zzos/Python

Fork 0

mirror of https://github.com/TheAlgorithms/Python.git synced 2026-09-28 13:33:11 +08:00

Files

T

History

e49caf57d0 types(reverse_selection): constrain items to Comparable (#15410 )

* types(reverse_selection): constrain items to Comparable

Bind reverse_selection_sort's element type to a Comparable Protocol so the
signature says "a list of items that can be compared with each other"
instead of a bare list, and keep the element type in the return.

reverse_subarray only swaps elements and never compares them, so its
TypeVar stays unbounded.

Also adds doctests for a comparable non-int type (strings, floats) and for
the failure mode: mixing non-comparable items must raise TypeError rather
than silently mis-sort. The test battery picks the sort up for the shared
cases and for the rejection check.

* updating DIRECTORY.md

---------

Co-authored-by: AuroraAeon <auroraeon@users.noreply.github.com>
Co-authored-by: Christian Clauss <cclauss@me.com>
Co-authored-by: cclauss <cclauss@users.noreply.github.com>

2026-09-24 22:09:11 +02:00

__init__.py

Add __init__.py files in all the directories (#2503 )

2020-09-28 19:42:36 +02:00

adaptive_merge_sort.py

Refactor adaptive_merge_sort for type safety with Protocol (#15367 )

2026-09-18 02:44:50 +02:00

bead_sort.py

Enable ruff RUF007 rule (#11349 )

2024-04-20 16:20:27 +02:00

benchmark_sorts.py

sorts: add cross-algorithm benchmark (sorts/benchmark_sorts.py) (#15284 )

2026-09-12 18:51:52 +02:00

binary_insertion_sort.py

Improve binary insertion sort comparable typing (#15238 )

2026-09-09 15:41:01 +02:00

bitonic_sort.py

Bitonic sort comparable (#15428 )

2026-09-24 16:16:10 +02:00

bogo_sort.py

sorts: make bogo_sort generic for comparable items (#15401 )

2026-09-22 19:06:45 +02:00

bubble_sort_recursive.py

sorts: make recursive bubble sort support comparable items (#15339 )

2026-09-18 02:45:49 +02:00

bubble_sort.py

sorts: type bubble sort for any comparable items (#15240 )

2026-09-09 16:55:55 +02:00

bucket_sort.py

fix: reject non-integer bucket counts (#14991 )

2026-09-13 13:31:09 +02:00

circle_sort.py

sorts: support comparable items in circle_sort (#15244 )

2026-09-09 22:31:35 +00:00

cocktail_shaker_sort.py

sorts: type cocktail shaker sort for comparable items (#15278 )

2026-09-11 23:59:59 +02:00

comb_sort.py

sorts: make comb_sort generic for comparable items (#15288 )

2026-09-12 07:53:55 +02:00

counting_sort.py

[pre-commit.ci] pre-commit autoupdate (#9013 )

2023-08-29 15:18:10 +02:00

cycle_sort.py

sorts: make cycle_sort generic for comparable items (#15329 )

2026-09-18 02:46:54 +02:00

cyclic_sort.py

Add input validation to cyclic_sort to prevent invalid inputs (#15009 )

2026-09-09 14:20:28 +02:00

double_sort.py

sorts: type double_sort for any comparable items (#15345 )

2026-09-18 02:38:02 +02:00

dutch_national_flag_sort.py

[pre-commit.ci] pre-commit autoupdate (#11322 )

2024-03-13 07:52:41 +01:00

exchange_sort.py

sorts: make exchange_sort generic for comparable items (#15304 )

2026-09-12 22:34:45 +02:00

external_sort.py

ruff rule ANN202 missing-return-type-private-function (#15298 )

2026-09-12 21:47:08 +02:00

flash_sort.py

Fix flash_sort permutation phase raising IndexError on repeated values (#15380 )

2026-09-21 11:31:17 +02:00

gnome_sort.py

Make gnome sort generic over comparable items (#15261 )

2026-09-10 17:50:21 +02:00

heap_sort.py

sorts: make heap sort support comparable items (#15291 )

2026-09-12 13:02:21 +02:00

insertion_sort.py

test: verify insertion sort modifies input collection (#15335 )

2026-09-18 02:51:29 +02:00

intro_sort.py

sorts: type intro sort for comparable items (#15403 )

2026-09-24 15:55:56 +02:00

iterative_merge_sort.py

types(iterative_merge_sort): constrain items to Comparable (#15413 )

2026-09-24 16:02:45 +02:00

kirkpatrick_reisch_sort.py

Kirkpatrcik Reisch Sort (#11552 )

2026-09-09 14:34:50 +02:00

merge_insertion_sort.py

sorts: make merge_insertion_sort generic over Comparable items (#15417 )

2026-09-24 15:58:39 +02:00

merge_sort.py

Fix merge sort comparable clean (#15259 )

2026-09-10 00:23:12 +02:00

msd_radix_sort.py

ruff rule ANN202 missing-return-type-private-function (#15298 )

2026-09-12 21:47:08 +02:00

natural_sort.py

Create natural_sort.py (#3286 )

2020-10-15 13:45:17 +02:00

normal_distribution_quick_sort.md

pre-commit: Add zizmor and replace prettier with rumdl (#15236 )

2026-09-09 09:55:19 +01:00

odd_even_sort.py

sorts: make odd_even_sort generic over any comparable type (Part of #15234 ) (#15378 )

2026-09-21 14:01:45 +02:00

odd_even_transposition_parallel.py

ruff rule ANN202 missing-return-type-private-function (#15298 )

2026-09-12 21:47:08 +02:00

odd_even_transposition_single_threaded.py

feat(sorts): make odd-even transposition generic over comparable items (#15405 )

2026-09-23 08:46:44 +02:00

pancake_sort.py

docs: Add type hints and improve documentation for pancake_sort (#13960 )

2026-09-19 23:59:14 +02:00

patience_sort.py

sorts: type patience_sort's Stack for any comparable item (#15427 )

2026-09-24 16:08:14 +02:00

pigeon_sort.py

[pre-commit.ci] pre-commit autoupdate (#11322 )

2024-03-13 07:52:41 +01:00

pigeonhole_sort.py

ruff rule ANN202 missing-return-type-private-function (#15298 )

2026-09-12 21:47:08 +02:00

power_sort.py

added powersort in sorts/power_sort.py (#13219 )

2026-09-09 14:30:54 +02:00

quick_sort_3_partition.py

sorts: make quick_sort_3_partition generic over Comparable items (#15431 )

2026-09-24 22:03:33 +02:00

quick_sort.py

sorts: make quick_sort work with any Comparable, not just int (#15327 )

2026-09-18 02:47:33 +02:00

radix_sort.py

fix(sorts): raise ValueError for negative inputs in radix_sort (#14950 ) (#14986 )

2026-09-09 14:18:19 +02:00

README.md

pre-commit: Add zizmor and replace prettier with rumdl (#15236 )

2026-09-09 09:55:19 +01:00

recursive_insertion_sort.py

sorts: make recursive_insertion_sort generic over Comparable items (#15340 )

2026-09-21 14:03:36 +02:00

recursive_mergesort_array.py

fix: type recursive mergesort for comparable items (#15406 )

2026-09-23 08:10:19 +02:00

recursive_quick_sort.py

Make some ruff fixes (#8154 )

2023-03-01 17:23:33 +01:00

reverse_selection.py

types(reverse_selection): constrain items to Comparable (#15410 )

2026-09-24 22:09:11 +02:00

reversort.py

feat(sorts): make reversort generic over comparable items (#15402 )

2026-09-22 23:21:26 +02:00

selection_sort.py

docs: add time and space complexity to selection_sort docstring (#13972 )

2026-09-21 14:11:32 +02:00

shell_sort.py

sorts: make shell_sort work with any Comparable, not just int (#15326 )

2026-09-18 02:41:47 +02:00

shrink_shell_sort.py

sorts: type shrink shell sort for comparable items (#15334 )

2026-09-18 02:46:24 +02:00

slowsort.py

sorts: type slowsort for any comparable items (#15347 )

2026-09-18 02:39:28 +02:00

smoothsort.py

Add Smoothsort algorithm implementation (#13534 )

2026-09-09 14:23:17 +02:00

stalin_sort.py

Fix stalin_sort raising IndexError on an empty list (#15382 )

2026-09-20 06:31:29 +02:00

stooge_sort.py

sorts: type stooge_sort for any comparable items (#15346 )

2026-09-18 02:38:45 +02:00

strand_sort.py

sorts: make strand sort work with comparable types (#15350 )

2026-09-21 18:50:09 +02:00

tim_sort.py

types: constrain tim sort items to Comparable (#15432 )

2026-09-24 16:26:56 +02:00

topological_sort.py

New (#12295 )

2026-09-13 01:12:34 +02:00

tree_sort.py

Fix tree_sort dropping duplicate values (#15381 )

2026-09-20 23:13:55 +02:00

unknown_sort.py

sorts: type unknown_sort's merge_sort for any comparable item (#15426 )

2026-09-24 16:05:09 +02:00

wiggle_sort.py

Fix negative indexing bug and improve readability in wiggle_sort (#15371 )

2026-09-18 02:49:10 +02:00

README.md

Sorting Algorithms

Sorting is the process of putting data in a specific order. The way to arrange data in a specific order is specified by the sorting algorithm. The most typical orders are lexical or numerical. The significance of sorting lies in the fact that, if data is stored in a sorted manner, data searching can be highly optimised. Another use for sorting is to represent data in a more readable manner.

This section contains a lot of important algorithms that help us to use sorting algorithms in various scenarios.

README.md

Sorting Algorithms

References