Gabrielly de S. Pinto Dantas 1a26d76c60
add tests for tree_sort (#10015)
* add tests for tree_sort

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

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

* Update tree_sort.py

---------

Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
Co-authored-by: Christian Clauss <cclauss@me.com>
2023-10-16 02:44: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
2023-09-23 10:53:09 +02:00
2023-10-03 22:07:25 -04:00
2023-10-03 22:06:52 -04:00
2021-09-07 13:37:03 +02:00
2023-10-03 22:05:47 -04:00
2023-03-01 17:23:33 +01:00
2023-10-16 02:44:10 +02: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 help us to use sorting algorithms in various scenarios.

References