mirror of
https://github.com/autistic-symposium/master-algorithms-py.git
synced 2025-04-29 20:26:07 -04:00
20 lines
877 B
Markdown
20 lines
877 B
Markdown
## sorting
|
|
|
|
<br>
|
|
|
|
* **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:
|
|
|
|
<br>
|
|
|
|
<p align="center">
|
|
<img src="https://github.com/go-outside-labs/master-algorithms-py/assets/138340846/7037aee5-9a83-4949-83df-e4c730debea4" width="60%" align="center" style="padding:1px;border:1px solid black;">
|
|
</p>
|
|
|
|
|