Feature Request: Implement various sorting algorithms

[arvinder004]

Fixes #660

Brief description of what is fixed or changed

This pull request introduces the Shell Sort algorithm to the sorting module, implemented in a style consistent with existing algorithms like insertion_sort. It includes:

• A shell_sort function in algorithms.py that supports partial sorting (start to end), custom comparators (comp), and backend switching (backend).
• Comprehensive tests in test_algorithms.py using pytest and pytest-cov, covering typical cases, edge cases (empty, single-element), sorted/reverse-sorted lists, duplicates, and negative numbers.
• Documentation with examples in the function's docstring, matching the project's format.

The implementation uses a simple gap sequence (n // 2) for clarity, with potential for future optimization using advanced sequences

[arvinder004]

Fixes #660

Brief description of what is fixed or changed

This pull request introduces the Radix Sort algorithm to the sorting module, implemented in a style consistent with existing algorithms like insertion_sort and shell_sort. It includes:

• A radix_sort function in sorting.py that supports partial sorting (start to end), custom comparators (comp, ignored as it’s non-comparison-based), and backend switching (backend). The implementation sorts non-negative integers using a counting sort subroutine for each digit.
• Comprehensive tests in test_sorting.py using pytest and pytest-cov, covering typical cases (multi-digit numbers), edge cases (empty, single-element), sorted/reverse-sorted lists, duplicates, large numbers, and error handling for negative numbers.
• Documentation with examples in the function's docstring, matching the project's format.

[TripleCamellya]

Here are my personal advice for you. But the final interpretation right is reserved by @czgdp1807 .

1. For linear_data_structures/algorithms.py, add your public API for algorithms in __all__ at the beginning of file. Like append 'shell_sort'. Also you should add your functions in linear_algorithms/__init__.py, from line 27from .algorithms import (.... This is how other modules can call function of module linear_data_structures.
2. You didn't implement cpp's code for your sorting algorithms under linear_data_structures/_backend, so don't add

if backend == Backend.CPP:
        return _algorithms.shell_sort(array, **kwargs)

3. After 1, you can add your algorithms in linear_data_structures/tests/test_algorithm.py, replace line 10 :

from pydatastructs.linear_data_structures.algorithms import shell_sort, radix_sort

to append after import of line1:

from pydatastructs import (
... intro_sort, shell_sort, Backend)

4. See the _test_common_sort() in test file. If your test can use it, directly call it.
5. Since you add a new function, you'd better update docs.

Maybe there are other things should you do. I think you can search for an already implemented sorting algorithm, search for that function name in the IDE to see where it is used, and then imitate it to add your new function. This maybe reduce inconsistency.

[arvinder004]

Sure sir, I got it. Thankyou for taking out your valueable time to review my PR and suggesting changes

[codecov]

Codecov Report

Attention: Patch coverage is 92.15686% with 4 lines in your changes missing coverage. Please review.

Project coverage is 97.278%. Comparing base (f4c1677) to head (99cd580).
Report is 3 commits behind head on main.

Files with missing lines	Patch %	Lines
pydatastructs/linear_data_structures/algorithms.py	92.156%	4 Missing ⚠️

Additional details and impacted files

@@              Coverage Diff              @@
##              main      #661       +/-   ##
=============================================
- Coverage   97.345%   97.278%   -0.067%     
=============================================
  Files           36        36               
  Lines         4445      4593      +148     
=============================================
+ Hits          4327      4468      +141     
- Misses         118       125        +7     

Files with missing lines	Coverage Δ
pydatastructs/linear_data_structures/__init__.py	100.000% <ø> (ø)
pydatastructs/linear_data_structures/algorithms.py	98.573% <92.156%> (-0.642%)	⬇️

🚀 New features to boost your workflow:

• ❄ Test Analytics: Detect flaky tests, report on failures, and find test suite problems.

[arvinder004]

@TripleCamellya Please check my latest commit, I have done all the suggested changes. I needed a seperated test file so kept the previous one for that

[TripleCamellya]

Codecov Report

Attention: Patch coverage is 92.15686% with 4 lines in your changes missing coverage. Please review.

Project coverage is 97.278%. Comparing base (f4c1677) to head (99cd580).
Report is 3 commits behind head on main.

Files with missing lines Patch % Lines
pydatastructs/linear_data_structures/algorithms.py 92.156% 4 Missing ⚠️
Additional details and impacted files
🚀 New features to boost your workflow:

1. There are unreachable branches in your algorithm. Line 1981 said start must less than end, then for line 1984-1986, n must more than 0. So the judge is unreachable.
2. Your test code didn't use DynamicArray, so the branch for DynamicArray failed. You can refer to _test_common_sort().

[arvinder004]

@TripleCamellya Sir please see this PR

[TripleCamellya]

Just wait for czgdp1807's review.

[arvinder004]

okay sir.
@czgdp1807 sir please review.