mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-12-18 01:00:15 +00:00
417b7edfc3
* don't need to return list because list is mutable * Don't need to return list as list is mutable * use advantage of python in swapping * filter blank inputs from input list * minor changes * minor mistake * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * more readable * Update double_sort.py * last fixes * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * Apply suggestions from code review * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci --------- Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com> Co-authored-by: Christian Clauss <cclauss@me.com> |
||
|---|---|---|
| .. | ||
| __init__.py | ||
| bead_sort.py | ||
| binary_insertion_sort.py | ||
| bitonic_sort.py | ||
| bogo_sort.py | ||
| bubble_sort.py | ||
| bucket_sort.py | ||
| circle_sort.py | ||
| cocktail_shaker_sort.py | ||
| comb_sort.py | ||
| counting_sort.py | ||
| cycle_sort.py | ||
| double_sort.py | ||
| dutch_national_flag_sort.py | ||
| exchange_sort.py | ||
| external_sort.py | ||
| gnome_sort.py | ||
| heap_sort.py | ||
| insertion_sort.py | ||
| intro_sort.py | ||
| iterative_merge_sort.py | ||
| merge_insertion_sort.py | ||
| merge_sort.py | ||
| msd_radix_sort.py | ||
| natural_sort.py | ||
| normal_distribution_quick_sort.md | ||
| odd_even_sort.py | ||
| odd_even_transposition_parallel.py | ||
| odd_even_transposition_single_threaded.py | ||
| pancake_sort.py | ||
| patience_sort.py | ||
| pigeon_sort.py | ||
| pigeonhole_sort.py | ||
| quick_sort_3_partition.py | ||
| quick_sort.py | ||
| radix_sort.py | ||
| README.md | ||
| recursive_insertion_sort.py | ||
| recursive_mergesort_array.py | ||
| recursive_quick_sort.py | ||
| selection_sort.py | ||
| shell_sort.py | ||
| shrink_shell_sort.py | ||
| slowsort.py | ||
| stooge_sort.py | ||
| strand_sort.py | ||
| tim_sort.py | ||
| topological_sort.py | ||
| tree_sort.py | ||
| unknown_sort.py | ||
| wiggle_sort.py | ||
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.