Maxim Smolskiy 7b88e15b1c
Enable ruff RUF007 rule (#11349)
* Enable ruff RUF005 rule

* Enable ruff RUF007 rule

* Fix

* Fix

* Fix

* Update sorts/bead_sort.py

Co-authored-by: Christian Clauss <cclauss@me.com>

* Update sorts/bead_sort.py

* Revert "Update sorts/bead_sort.py"

This reverts commit b10e5632e4479c2117c8b67113b5aa6545f127aa.

* Revert "Update sorts/bead_sort.py"

This reverts commit 2c1816bf102eeec5aa39cb2f1806afb64b672d14.

* Update sorts/bead_sort.py

---------

Co-authored-by: Christian Clauss <cclauss@me.com>
2024-04-20 16:20:27 +02:00
..
2024-04-20 16:20:27 +02:00
2023-02-20 11:14:01 +13:00
2023-03-01 17:23:33 +01:00
2020-10-15 13:45:17 +02:00
2023-09-23 10:53:09 +02:00
2023-10-03 22:06:52 -04:00
2023-10-03 22:05:47 -04: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 help us to use sorting algorithms in various scenarios.

References