Corrected indentations in sorting.py

sorting.py

@@ -13,7 +13,7 @@ Al final se imprimen los promedios de cada algortimo
 from random import randint
 import time
 from merge import merge
-from heap import heap
+import heap
 
 # Python program for implementation of MergeSort
 
@@ -22,29 +22,29 @@ from heap import heap
 # Second subarray is arr[m+1..r]
 
 def mergeSort(lista, l, r):
-	if l < r:
+		if l < r:
 
-	# Same as (l+r)//2, but avoids overflow for
-	# large l and h
-	m = l+(r-l)//2
+		# Same as (l+r)//2, but avoids overflow for
+		# large l and h
+		m = l+(r-l)//2
 
-	# Sort first and second halves
-	mergeSort(lista, l, m)
-	mergeSort(lista, m+1, r)
-	merge(lista, l, m, r)
+		# Sort first and second halves
+		mergeSort(lista, l, m)
+		mergeSort(lista, m+1, r)
+		merge(lista, l, m, r)
 
 def heapSort(lista):
 
-	n = len(lista)
-	h1 = (n // 2) - 1
-	for i in range(h1, -1, -1):
-		heapify(lista, n, i)
+		n = len(lista)
+		h1 = (n // 2) - 1
+		for i in range(h1, -1, -1):
+			heapify(lista, n, i)
 
-	for i in range(h1, -1, -1):
-		lista[i], lista[0] = lista[0], lista[i]
-		heapify(lista, i, 0)
+		for i in range(h1, -1, -1):
+			lista[i], lista[0] = lista[0], lista[i]
+			heapify(lista, i, 0)
 
-	return lista
+		return lista
 
 def quickSort(lista):
 	#definan el algoritmo de ordenamiento quicksort