master-algorithms-py/sorting at 0ba5a05762338462b4919a7ab026f9f7abadce43 - master-algorithms-py - Gitea: Git with a cup of tea

Git-Mirrors/master-algorithms-py

mirror of https://github.com/autistic-symposium/master-algorithms-py.git synced 2025-04-29 20:26:07 -04:00

History

marina 0ba5a05762

2023-08-02 20:57:44 -07:00

..

bubble_sort.py

Create bubble_sort.py

2023-08-02 20:53:18 -07:00

bucket_sort.py

Create bucket_sort.py

2023-08-02 20:56:20 -07:00

counting_sort.py

Create counting_sort.py

2023-08-02 20:55:05 -07:00

insertion_sort.py

Create insertion_sort.py

2023-08-02 20:54:05 -07:00

merge_sort.py

Create merge_sort.py

2023-08-02 20:56:55 -07:00

quick_sort.py

quick_sort.py

2023-08-02 20:57:44 -07:00

README.md

Update README.md

2023-08-02 20:57:18 -07:00

seletction_sort.py

Create seletction_sort.py

2023-08-02 20:52:30 -07:00

README.md

sorting

inversions in a sequence is a pair of elements that are out of order with respect to the ordering relation. a sorting algorithm is a sequence of operations that reduces inversions to zero.
a topological sort of a diretect graph is a way of ordering the list of nodes such that if (a, b) is a edge of the graph, then a appears before b. it does not work if a graph has cycles or is not directed.