Git-Mirrors/master-algorithms-py
1
0
Fork 0
mirror of https://github.com/autistic-symposium/master-algorithms-py.git synced 2025-04-29 12:16:14 -04:00
Code Issues Packages Projects Releases Wiki Activity

Update README.md

Browse Source
This commit is contained in:
bt3gl 2023-08-08 17:47:09 -07:00 committed by GitHub
parent 3d8e44eef9
commit 2ef7451aba
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
sorting/README.md
View File

@ -2,9 +2,9 @@
<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.
* **inversions** in a sequence are 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.
* a **topological sort** of a directed graph is a way of ordering the list of nodes such that if `(a, b)` is an 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)`).