added heap sort

Author: andreidumitrescu95

Algorithms/__pycache__/heap_sort.cpython-38.pyc

@@ -0,0 +1,40 @@
+from Display.display import update_display
+from Helper.global_variables import *
+
+# To heapify subtree rooted at index i. 
+# n is size of heap 
+def heapify(height, n, i, color_height, win, numswaps, algorithm, number_of_elements, speed): 
+    largest = i  # Initialize largest as root 
+    l = 2 * i + 1     # left = 2*i + 1 
+    r = 2 * i + 2     # right = 2*i + 2 
+  
+    # See if left child of root exists and is 
+    # greater than root 
+    if l < n and height[i] < height[l]: 
+        largest = l 
+  
+    # See if right child of root exists and is 
+    # greater than root 
+    if r < n and height[largest] < height[r]: 
+        largest = r 
+  
+    # Change root, if needed 
+    if largest != i: 
+        height[i],height[largest] = height[largest],height[i]  # swap 
+        update_display(win, height, color_height, numswaps, algorithm, number_of_elements, speed, 0, True)
+        # Heapify the root. 
+        heapify(height, n, largest, color_height, win, numswaps, algorithm, number_of_elements, speed) 
+  
+# The main function to sort an heightay of given size 
+def heap_sort(height, color_height, win, numswaps, algorithm, number_of_elements, speed): 
+    n = len(height) 
+
+    # Build a maxheap. 
+    # Since last parent will be at ((n//2)-1) we can start at that location. 
+    for i in range(n // 2 - 1, -1, -1): 
+        heapify(height, n, i, color_height, win, numswaps, algorithm, number_of_elements, speed) 
+  
+    # One by one extract elements 
+    for i in range(n-1, 0, -1): 
+        height[i], height[0] = height[0], height[i]   # swap 
+        heapify(height, i, 0, color_height, win, numswaps, algorithm, number_of_elements, speed) 

Algorithms/__pycache__/insertion_sort.cpython-38.pyc

@@ -25,4 +25,7 @@ def insertion_sort(win, height, color_height, numswaps, algorithm, number_of_ele
                 color_height[j] = TURQUOISE
         height[j + 1] = key 
 
+    for i in range(len(color_height)):
+        color_height[i] = PURPLE
+    
     return numswaps

Algorithms/heap_sort.py

@@ -12,6 +12,7 @@
 from Algorithms.selection_sort import selection_sort
 from Algorithms.insertion_sort import insertion_sort
 from Algorithms.merge_sort import merge_sort
+from Algorithms.heap_sort import heap_sort
 from Display.display import update_display, show
 
 pygame.init() 
@@ -78,6 +79,11 @@ def main(win):
             else:
                 button_selection_sort.background_color = DARK_BUTTON
 
+            if(button_heap_sort.check() == True):
+                button_heap_sort.background_color = LIGHT_BUTTON
+            else:
+                button_heap_sort.background_color = DARK_BUTTON
+
             if(button_merge_sort.check() == True):
                 button_merge_sort.background_color = LIGHT_BUTTON
             else:
@@ -143,13 +149,19 @@ def main(win):
 
                     if(algorithm == "Insertion Sort"):
                         start_time = time.time()
-                        numswaps = insertion_sort(win, height, color_height, 0, algorithm, number_of_elements, speed)
+                        current_numswaps = insertion_sort(win, height, color_height, 0, algorithm, number_of_elements, speed)
                         elapsed_time = time.time() - start_time
                         update_display(win, height, color_height, current_numswaps, algorithm, number_of_elements, speed, elapsed_time, False)
 
                     if(algorithm == "Selection Sort"):
                         start_time = time.time()
-                        numswaps = selection_sort(win, height, color_height, 0, algorithm, number_of_elements, speed)
+                        current_numswaps = selection_sort(win, height, color_height, 0, algorithm, number_of_elements, speed)
+                        elapsed_time = time.time() - start_time
+                        update_display(win, height, color_height, current_numswaps, algorithm, number_of_elements, speed, elapsed_time, False)
+
+                    if(algorithm == "Heap Sort"):
+                        start_time = time.time()
+                        current_numswaps = heap_sort(height, color_height, win, 0, algorithm, number_of_elements, speed)
                         elapsed_time = time.time() - start_time
                         update_display(win, height, color_height, current_numswaps, algorithm, number_of_elements, speed, elapsed_time, False)
 
@@ -174,6 +186,9 @@ def main(win):
                 if(button_merge_sort.check() == True):
                     algorithm = "Merge Sort"
 
+                if(button_heap_sort.check() == True):
+                    algorithm = "Heap Sort"
+
                 if(button_20.check() == True):
                     number_of_elements = 20