mirror of
https://github.com/autistic-symposium/master-algorithms-py.git
synced 2025-04-30 04:36:08 -04:00
16 lines
661 B
Markdown
16 lines
661 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 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.
|
|
|
|
<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>
|
|
|
|
|