From 4caa1fe7f447753322e2dbffc255d3444eba5463 Mon Sep 17 00:00:00 2001
From: marina <138340846+bt3gl-cryptographer@users.noreply.github.com>
Date: Wed, 2 Aug 2023 13:31:19 -0700
Subject: [PATCH] Update README.md

---
 heaps/README.md | 16 ++++++++++++++++
 1 file changed, 16 insertions(+)

diff --git a/heaps/README.md b/heaps/README.md
index ceb39e8..61b2495 100644
--- a/heaps/README.md
+++ b/heaps/README.md
@@ -229,3 +229,19 @@ class MaxHeap:
         return str(self.maxheap[1 : self.realsize + 1])
 ```
 
+<br>
+
+---
+
+
+### heap sort
+
+<br>
+
+
+* the core concept of the heap sort involves constructing a heap from our input and then repeatedly removing the min/max element to sort the array.
+* the key idea for in-place heap sort involves a balance of these two ideas:
+	- building a heap from an unsorted array through a "bottom-up heapification" process, and
+ 	- using the heap to sort the input array
+* heapsort traditionally uses a max-heap to sort the array, although a min-heap also works.
+* this is not a stable sort.