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>