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

Files

T

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

* fix: reject non-integer bucket counts

Signed-off-by: ahmadalguydi <ahmadalgaidy@hotmail.com>

* Update bucket_sort.py

---------

Signed-off-by: ahmadalguydi <ahmadalgaidy@hotmail.com>
Co-authored-by: Christian Clauss <cclauss@me.com>

2026-09-13 13:31:09 +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

Improve binary insertion sort comparable typing (#15238 )

2026-09-09 15:41:01 +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

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

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

bogo_sort.py

Add type hints for bogo_sort.py (#14306 )

2026-03-09 06:32:52 +03:00

bubble_sort_recursive.py

feat: add recursive bubble sort algorithm with doctests and type hints (#13424 )

2026-09-09 14:35:35 +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

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

2023-08-29 15:18:10 +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

code enhancement in sort.double_sort (#10798 )

2023-10-23 09:51:27 +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

Flash sort (#13316 )

2026-09-09 14:32:54 +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

docs: add complexity analysis to insertion_sort docstring (#14939 )

2026-09-09 14:06:33 +02:00

intro_sort.py

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

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

iterative_merge_sort.py

Fix iter_merge_sort bug (#6153 )

2022-05-21 22:02:53 +08:00

kirkpatrick_reisch_sort.py

Kirkpatrcik Reisch Sort (#11552 )

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

merge_insertion_sort.py

ruff rules RET for return statements (#15301 )

2026-09-12 21:33:52 +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

pre-commit: Upgrade psf/black for stable style 2023 (#8110 )

2023-02-01 18:44:54 +05:30

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

Fix word typos in comments (#4928 )

2021-10-04 12:07:58 +08:00

pancake_sort.py

Improve insertion_sort docstring with complexity analysis (#14875 )

2026-09-13 13:24:40 +02:00

patience_sort.py

fix: comment in patience sort (#4972 )

2021-10-04 11:33:42 +08: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

add doctest for quick_sort_3_partition (#11779 )

2024-12-30 23:03:31 +03:00

quick_sort.py

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

2024-03-13 07:52:41 +01: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

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

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

recursive_mergesort_array.py

fix: use += in sorts/recursive_mergesort_array.py (#5019 )

2021-10-27 00:43:46 +08:00

recursive_quick_sort.py

Make some ruff fixes (#8154 )

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

reverse_selection.py

Added reverse_selection.py (#11809 )

2026-09-09 14:25:12 +02:00

reversort.py

feat: add Reversort sorting algorithm (#14482 )

2026-09-09 14:33:33 +02:00

selection_sort.py

sorts: type selection sort for comparable items (#15245 )

2026-09-09 23:34:24 +02:00

shell_sort.py

Add typing (#9652 )

2023-10-03 22:06:52 -04:00

shrink_shell_sort.py

pre-commit: Upgrade psf/black for stable style 2023 (#8110 )

2023-02-01 18:44:54 +05:30

slowsort.py

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

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

smoothsort.py

Add Smoothsort algorithm implementation (#13534 )

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

stalin_sort.py

Create stalin_sort.py (#11989 )

2025-08-31 01:17:55 +03:00

stooge_sort.py

Add typing (#9651 )

2023-10-03 22:05:47 -04:00

strand_sort.py

fix: no implicit optional (#7984 )

2022-11-15 14:55:14 +01:00

tim_sort.py

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

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

topological_sort.py

New (#12295 )

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

tree_sort.py

Fix/tree sort iterable type hint (#14701 )

2026-09-09 13:59:07 +02:00

unknown_sort.py

Add type hints to unknown_sort (#14489 )

2026-04-11 00:07:41 +03:00

wiggle_sort.py

Wiggle sort (#2419 )

2020-09-25 09:18:00 +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