mirror of https://github.com/TheAlgorithms/Python.git synced 2025-02-25 10:28:39 +00:00

History

Reduce the complexity of sorts/merge_insertion_sort.py (#7954 )

* Reduce the complexity of sorts/merge_insertion_sort.py

* Add tests

* Lower the --max-complexity threshold in the file .flake8

2022-12-24 15:57:28 +01:00

__init__.py

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

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

bead_sort.py

refactor: Indent ... for visual purposes (#7744 )

2022-10-27 19:42:30 +02:00

bitonic_sort.py

Remove useless code in doctests (#7733 )

2022-10-27 22:52:00 +02:00

bogo_sort.py

contribution guidelines checks (#1787 )

2020-03-04 13:40:28 +01:00

bubble_sort.py

For the better understanding of time taken. (#6583 )

2022-10-30 11:43:41 +01:00

bucket_sort.py

Fix bug in bucket_sort.py (#6005 )

2022-05-13 04:28:51 +08:00

circle_sort.py

Add circle sort implementation (#5548 )

2022-07-17 05:42:58 +08:00

cocktail_shaker_sort.py

[mypy]Correction of all errors in the sorts directory (#4224 )

2021-02-23 10:02:30 +01:00

comb_sort.py

Set the Python file maximum line length to 88 characters (#2122 )

2020-06-16 10:09:19 +02:00

counting_sort.py

contribution guidelines checks (#1787 )

2020-03-04 13:40:28 +01:00

cycle_sort.py

Remove boilerplate comments and unused variables (#2073 )

2020-06-07 23:05:22 +02:00

double_sort.py

Add flake8 pluin flake8 bugbear to pre-commit (#7132 )

2022-10-13 18:03:06 +02:00

dutch_national_flag_sort.py

Added Dutch National Flag algorithm #4636 (#4639 )

2021-08-31 22:06:49 +02:00

exchange_sort.py

Create exchange_sort.py (#4600 )

2021-08-15 07:43:05 +02:00

external_sort.py

Improve code on f-strings and brevity (#6126 )

2022-05-13 20:51:44 +08:00

gnome_sort.py

Gnome sort : type hints, docstrings, doctests (#2307 )

2020-08-14 22:00:08 +02:00

heap_sort.py

contribution guidelines checks (#1787 )

2020-03-04 13:40:28 +01:00

insertion_sort.py

Update insert sort (#2493 )

2020-10-03 20:49:08 +05:30

intro_sort.py

Create intro_sort.py (#3877 )

2020-11-25 09:54:31 +01:00

iterative_merge_sort.py

Fix iter_merge_sort bug (#6153 )

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

merge_insertion_sort.py

Reduce the complexity of sorts/merge_insertion_sort.py (#7954 )

2022-12-24 15:57:28 +01:00

merge_sort.py

Format docs (#7821 )

2022-10-29 08:26:19 +02:00

msd_radix_sort.py

clean of unnecessary checks, imports, calls (#7993 )

2022-11-21 00:00:27 +13:00

natural_sort.py

Create natural_sort.py (#3286 )

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

normal_distribution_quick_sort.md

Remove useless code in doctests (#7733 )

2022-10-27 22:52:00 +02:00

odd_even_sort.py

Format docs (#7821 )

2022-10-29 08:26:19 +02:00

odd_even_transposition_parallel.py

Add pep8-naming to pre-commit hooks and fixes incorrect naming conventions (#7062 )

2022-10-13 00:54:20 +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

contribution guidelines checks (#1787 )

2020-03-04 13:40:28 +01:00

patience_sort.py

fix: comment in patience sort (#4972 )

2021-10-04 11:33:42 +08:00

pigeon_sort.py

Pyupgrade to Python 3.9 (#4718 )

2021-09-07 13:37:03 +02:00

pigeonhole_sort.py

Create codespell.yml (#1698 )

2020-01-18 13:24:33 +01:00

quick_sort_3_partition.py

Quick sort with lomuto partition (#3875 )

2021-02-17 15:28:50 +01:00

quick_sort.py

refactor: pivot is randomly chosen (#6643 )

2022-10-05 11:32:07 +01:00

radix_sort.py

refactor: Move constants outside of variable scope (#7262 )

2022-10-16 15:03:29 +05:30

random_normal_distribution_quicksort.py

Add pep8-naming to pre-commit hooks and fixes incorrect naming conventions (#7062 )

2022-10-13 00:54:20 +02:00

random_pivot_quick_sort.py

Add pep8-naming to pre-commit hooks and fixes incorrect naming conventions (#7062 )

2022-10-13 00:54:20 +02:00

README.md

Updated info (#7866 )

2022-10-30 10:08:54 +01:00

recursive_bubble_sort.py

Optimized recursive_bubble_sort (#2410 )

2020-09-10 10:31:26 +02:00

recursive_insertion_sort.py

Remove useless code in doctests (#7733 )

2022-10-27 22:52:00 +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

hyphen_files = [file for file in filepaths if "-" in file] (#2447 )

2020-09-19 07:13:10 +02:00

selection_sort.py

contribution guidelines checks (#1787 )

2020-03-04 13:40:28 +01:00

shell_sort.py

Optimization shell sort (#4119 )

2021-02-26 09:01:50 +08:00

shrink_shell_sort.py

Add Optimized Shell Sort (#6225 )

2022-09-14 09:43:08 +01:00

slowsort.py

Pyupgrade to Python 3.9 (#4718 )

2021-09-07 13:37:03 +02:00

stooge_sort.py

Add Topological Sort (#1302 )

2019-10-18 08:13:58 +02:00

strand_sort.py

fix: no implicit optional (#7984 )

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

tim_sort.py

Update tim_sort.py (#972 )

2019-07-30 18:06:48 +02:00

topological_sort.py

Fix word typos in comments (#4928 )

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

tree_sort.py

Add pep8-naming to pre-commit hooks and fixes incorrect naming conventions (#7062 )

2022-10-13 00:54:20 +02:00

unknown_sort.py

Set the Python file maximum line length to 88 characters (#2122 )

2020-06-16 10:09:19 +02: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 helps us to use sorting algorithms in various scenarios.

README.md

Sorting Algorithms

References