From 6dbc4e5fc67490e09ed7574910ed497d0abc5e18 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Pascal=20R=C3=B6ssler?=
 <78089013+ForeignGods@users.noreply.github.com>
Date: Mon, 20 Jun 2022 17:14:04 +0200
Subject: [PATCH] Update README.md

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

diff --git a/README.md b/README.md
index df206f1..e5ce262 100644
--- a/README.md
+++ b/README.md
@@ -15,6 +15,7 @@ Table of contents
       * [Bubble Sort](#bubble-sort)
       * [Insertion Sort](#insertion-sort)
       * [Selection Sort](#selection-sort)
+      * [Heap Sort](#heap-sort)
       * [Shell Sort](#shell-sort)
       * [Merge Sort](#merge-sort)
       * [Quick Sort](#quick-sort)
@@ -113,6 +114,13 @@ The selection sort algorithm sorts an array by repeatedly finding the minimum el
 | ------------- |:-------------:| 
 |![SelectionSort2](https://user-images.githubusercontent.com/78089013/174033035-b6b9527a-3d12-4844-b066-50b4cb9d11ef.gif)|![SelectionSort2](https://user-images.githubusercontent.com/78089013/174156159-605f5121-06c3-4314-a22c-5f7919bb9c44.gif)| 
 
+
+## Heap Sort
+
+|<a href="https://github.com/ForeignGods/Sorting-Algorithms-Blender/blob/main/sort_scale/heap_sort_scale.py" target="_blank">heap_sort_scale.py</a>|<a href="https://github.com/ForeignGods/Sorting-Algorithms-Blender/blob/main/sort_color/heap_sort_color.py" target="_blank">heap_sort_color.py</a>| 
+| ------------- |:-------------:| 
+|![HeapScale](https://user-images.githubusercontent.com/78089013/174625884-ed64292c-c5cf-4fe8-af9f-bddb2e5fa6bf.gif)||   
+  
 ## Shell Sort
 <p>
 The shell sort algorithm extends the insertion sort algorithm and is very efficient in sorting widely unsorted arrays.<br>