From e7995a9461bb4c6b842dd8b23aa740cd45c4cd2b Mon Sep 17 00:00:00 2001
From: marina <138340846+bt3gl-cryptographer@users.noreply.github.com>
Date: Wed, 2 Aug 2023 20:57:05 -0700
Subject: [PATCH] Update README.md

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

diff --git a/sorting/README.md b/sorting/README.md
index 35f212e..5563f59 100644
--- a/sorting/README.md
+++ b/sorting/README.md
@@ -3,8 +3,16 @@
 <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>
+
+
 
 <br>