Git-Mirrors/master-algorithms-py
1
0
Fork 0
mirror of https://github.com/autistic-symposium/master-algorithms-py.git synced 2025-05-22 16:31:15 -04:00
Code Issues Projects Releases Packages Wiki Activity
master-algorithms-py/sorting
History
marina 5b38a549a7
Update seletction_sort.py
2023-08-02 23:42:21 -07:00
..
bubble_sort.py Update bubble_sort.py 2023-08-02 23:39:04 -07:00
bucket_sort.py Update bucket_sort.py 2023-08-02 23:40:13 -07:00
counting_sort.py Update counting_sort.py 2023-08-02 23:41:18 -07:00
insertion_sort.py Update insertion_sort.py 2023-08-02 23:41:46 -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 21:14:00 -07:00
seletction_sort.py Update seletction_sort.py 2023-08-02 23:42:21 -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 directed 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. this type of sorting does not work if a graph has cycles or is not directed.

  • because of their efficiencies, you usually want to use either merge sort or quick sort (O(N log (N)).

  • other type of sorting algorithms can be seen below and in this directory's source code: