Files
Python/sorts
Mahemapre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>Maxim Smolskiy
fc2f947e0f Fix empty input edge case and correct output formatting (#14444)
* Fix empty input edge case and correct output formatting

* [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

* Update pigeonhole_sort.py

* Update pigeonhole_sort.py

* Update pigeonhole_sort.py

---------

Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
Co-authored-by: Maxim Smolskiy <mithridatus@mail.ru>
2026-04-11 01:07:38 +03:00
..
2024-04-20 16:20:27 +02:00
2025-10-15 19:22:51 +02:00
2023-03-01 17:23:33 +01:00
2025-10-15 19:35:55 +02:00
2025-08-26 21:42:14 +03:00
2025-07-06 01:35:29 +03:00
2023-09-23 10:53:09 +02:00
2023-10-03 22:06:52 -04:00
2025-08-31 01:17:55 +03:00
2023-10-03 22:05:47 -04:00
2025-07-06 01:35:29 +03:00

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.

References