From 908352604b2ae929b64d561310d00b68f359b022 Mon Sep 17 00:00:00 2001 From: marina <138340846+bt3gl-cryptographer@users.noreply.github.com> Date: Wed, 2 Aug 2023 21:00:21 -0700 Subject: [PATCH] Update README.md --- sorting/README.md | 6 +++++- 1 file changed, 5 insertions(+), 1 deletion(-) diff --git a/sorting/README.md b/sorting/README.md index 13e6696..e264a89 100644 --- a/sorting/README.md +++ b/sorting/README.md @@ -4,7 +4,11 @@ * **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. +* 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: