pre-commit-ci[bot] 421ace81ed
[pre-commit.ci] pre-commit autoupdate (#9013)
* [pre-commit.ci] pre-commit autoupdate

updates:
- [github.com/astral-sh/ruff-pre-commit: v0.0.285 → v0.0.286](https://github.com/astral-sh/ruff-pre-commit/compare/v0.0.285...v0.0.286)
- [github.com/tox-dev/pyproject-fmt: 0.13.1 → 1.1.0](https://github.com/tox-dev/pyproject-fmt/compare/0.13.1...1.1.0)

* updating DIRECTORY.md

* Fis ruff rules PIE808,PLR1714

---------

Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
Co-authored-by: Christian Clauss <cclauss@me.com>
2023-08-29 15:18:10 +02:00
..
2023-02-20 11:14:01 +13:00
2023-03-01 17:23:33 +01:00
2020-11-25 09:54:31 +01:00
2022-10-29 08:26:19 +02:00
2023-03-01 17:23:33 +01:00
2020-10-15 13:45:17 +02:00
2021-09-07 13:37:03 +02:00
2023-03-01 17:23:33 +01:00
2022-10-30 10:08:54 +01:00
2021-02-26 09:01:50 +08:00
2021-09-07 13:37:03 +02:00
2023-03-01 17:23:33 +01:00
2020-09-25 09:18:00 +02: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 helps us to use sorting algorithms in various scenarios.

References