Updated sorting.py with a better heap sort algorithm

sorting.py

@@ -10,7 +10,7 @@ Al final se imprimen los promedios de cada algortimo
 from random import randint
 import time
 from merge import merge
-from heapq import heapify
+import heapq
 
 # Python program for implementation of MergeSort
 
@@ -30,18 +30,17 @@ def mergeSort(lista, l, r):
 	mergeSort(lista, m+1, r)
 	merge(lista, l, m, r)
 
-def heapSort(lista):
+# Luis A. López Mañán
+# Code retreived from docs.python.org/3/library/heapq.html
+# October 11th, 2022
 
-	n = len(lista)
-	h1 = (n // 2) - 1
-	for i in range(h1, -1, -1):
-		heapify(lista[i])
+def heapSort(lista):
 
-	for i in range(n-1, -1, -1):
-		lista[i], lista[0] = lista[0], lista[i]
-		heapify(lista[i])
+	h = []
 
-	return lista
+	for val in lista:
+		heappush(h, val)
+	return [heappop(h) for i in range(len(h))]
 
 def quickSort(lista):
 	#definan el algoritmo de ordenamiento quicksort