Update heap_sort.py

Author: ankit167

sort/heap_sort.py

@@ -9,6 +9,7 @@ def max_heap_sort(arr):
         arr[0] = arr[i]
         arr[i] = temp
 
+	
 def max_heapify(arr, end):
     """ Max heapify helper for max_heap_sort
     """
@@ -35,13 +36,15 @@ def max_heapify(arr, end):
             # If no swap occured, no need to keep iterating
             else:
                 break
+		
 
 def min_heap_sort(arr):
     """ Heap Sort that uses a min heap to sort an array in ascending order
         Complexity: O(n log(n))
     """
     for i in range(0, len(arr)-1):
         min_heapify(arr, i)
+	
 
 def min_heapify(arr, start):
     """ Min heapify helper for min_heap_sort
@@ -87,4 +90,4 @@ def min_heapify(arr, start):
 	min_heap_sort(array)
 	print(array)
 	print("Max Heapify Time:", timeit.timeit('max_heap_sort(array)', setup="from __main__ import max_heap_sort, array",number=10000))
-	print("Min Heapify Time:", timeit.timeit('min_heap_sort(array)', setup="from __main__ import min_heap_sort, array",number=10000))
+	print("Min Heapify Time:", timeit.timeit('min_heap_sort(array)', setup="from __main__ import min_heap_sort, array",number=10000))