From abc3e2abf8a1df40b38fa2098bcd2f4212fb5a78 Mon Sep 17 00:00:00 2001
From: bt3gl <138340846+cypher-bt3gl@users.noreply.github.com>
Date: Sat, 29 Jul 2023 21:08:20 -0700
Subject: [PATCH] Update README.md

---
 sorting_and_searching/README.md | 8 ++++++++
 1 file changed, 8 insertions(+)

diff --git a/sorting_and_searching/README.md b/sorting_and_searching/README.md
index be9e482..3ab5d69 100644
--- a/sorting_and_searching/README.md
+++ b/sorting_and_searching/README.md
@@ -2,6 +2,14 @@
 
 <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>
+
+----
+
 ### `sorting_algorithms.py`
 
 <br>