update sorting.py again

sorting.py

@@ -30,25 +30,62 @@ def mergeSort(lista, l, r):
 	mergeSort(lista, m+1, r)
 	merge(lista, l, m, r)
 
-# Luis A. López Mañán
-# Code retreived from docs.python.org/3/library/heapq.html
-# October 11th, 2022
+''' Luis Andrés López Mañán
+    Program written by hand as a draft on 09/19/2022
+    Credit goes to GeeksForGeeks
+    Link: https://www.geeksforgeeks.org/python-program-for-heap-sort/
+    Last access on 09/19/2022
+    Program wrriten and edited on 10/10/2022
+'''
+
+# This function heapifies a subtree rooted at an index
+# i. Also, n is the size of a heap and arr is array.
+
+def heapify(lista, n, i):
+
+		# largest is root for now
+		largest = i
+
+		# left child of root
+		l = 2 * i + 1
+
+		# right child of root
+		r = 2 * i + 2
+
+		# Checks if root has a left child and is greater than root
+		if l < n and lista[i] < lista[l] :
+			largest = l
+
+		# Checks if root has a right child and is greater than root
+		if r < n and lista[largest] < lista[r]:
+			largest = r
+
+		# If necessary, this changes root by swapping values
+    	if largest != i:
+        	lista[i], lista[largest] = lista[largest], lista[i]
+
+		# This heapifies the root repeatedly
+		heapify(lista, n, largest)
 
 def heapSort(lista):
 
-	h = []
+		n = len(lista)
+		for i in range((n // 2) - 1, -1, -1):
+			heapify(lista, n, i)
+
+		for i in range(n-1, -1, -1):
+			lista[i], lista[0] = lista[0], lista[i]
+			heapify(lista, i, 0)
 
-	for val in lista:
-		heappush(h, val)
-	return [heappop(h) for i in range(len(h))]
+		return lista
 
 def quickSort(lista):
-	#definan el algoritmo de ordenamiento quicksort
-	return lista
+		#definan el algoritmo de ordenamiento quicksort
+		return lista
 
 def shellSort(lista):
-	#definan el algoritmo de ordenamiento shellsort
-	return lista
+		#definan el algoritmo de ordenamiento shellsort
+		return lista
 
 maxValor=1000 	#define el valor maximo de los elementos de la lista
 largoLista=1000 	#define el largo de las listas a ordenar