Arvinder Singh Dhoul
Arvinder Singh Dhoul
Fixes #679 #### Brief description of what is fixed or changed - Added the cocktail sort implementation in the C++ Backend file `quadratic_time_sort.hpp` - Exposed C++ functions to Python -...
Fixes #677 #### Brief description of what is fixed or changed - Added the Brick sort and Brick sort parallel implementations in the C++ Backend file `quadratic_time_sort.hpp` - Exposed C++...
This issue proposes adding a C++ backend for the Cocktail Sort algorithm (also known as Bidirectional Bubble Sort or Shaker Sort) to the pydatastructs library. Cocktail Sort is a comparison-based...
#### Description of the problem This issue proposes the addition of a C++ backend for the Brick Sort algorithm (also known as Odd-Even Sort) and its parallel version to the...
This pull request introduces a C++ backend implementation for the Breadth-First Search (BFS) algorithm, addressing the need for improved performance, especially when dealing with large graphs as outlined in #674...
The project currently has a Python implementation of the Breadth-First Search (BFS) algorithm. To improve performance and efficiency, especially when dealing with large graphs, a C++ backend implementation is needed....
## Fixes #664 This pull request introduces a reverse method to the pydatastructs library for linear data structures, starting with an implementation for the Array class in `linear_data_structures/algorithms.py` The addition...
### A Suffix Array for a string S of length n is an array of integers in the range [0, n-1] that specifies the lexicographical order of all suffixes of...
As mentioned, the Fenwick Tree is a data structure that efficiently calculates prefix sums and performs single element updates on an array. The core idea is that each element in...
This PR adds an opt-in, built-in retry mechanism with configurable policy and consistent behavior across adapters. It supports transient network errors, 429/503 with `Retry-After`, multiple backoff strategies (with jitter), timeout...