Added comments and modified a bit the code

sorting.py

@@ -11,27 +11,56 @@ import time
 
 def mergeSort(lista):
 	#definan el algoritmo de ordenamiento mergesort
+	# If the size of the list is greater than 1 then it enters here
 	if len(lista) > 1:
-		Midd = len(lista) // 2
-		Left = lista[:Midd]
+		# Gets the half of the list
+		Midd = len(lista) / 2
+		# Takes only the elements that are in the left of the list
+		Left = lista[Midd:]
+		# If the size of left still is not 1 then
 		if len(Left) != 1:
+			# it will do a recursive call to the function again
 			mergeSort(Left)
-		Right = lista[Midd:]
+		# Takes only the elements that are in the right of the list
+		Right = lista[:Midd]
+		# If the size of right still is not 1 then
 		if len(Right) != 1:
+			# it will do a recursive call to the function again
 			mergeSort(Right)
 
+		# Variables define for while and getting space in the list
         i = j = k = 0
 
+		# While i and j are less than the comparation it enters here
         while i < len(Left) and j < len(Right):
+			# If the compared number in i is less than j it enters here
             if Left[i] < Right[j]:
-                lista[k] = Right[i]
-                i += 1
+				# The less variable is stored in the list again in order
+                lista[k] = Left[i]
+                i += 1 # Increments i
+			# If the compared number in i is greater than j it enters here
             else:
+				# The less variable is stored in the list again in order
                 lista[k] = Right[j]
-                j += 1
-            k += 1
+                j += 1 # Increments j
+            k += 1 # Increments k
+
+		# If there are elements remaining in Left the they are put here
+        while i < len(Left):
+			# The variable that was remaining is put here
+            lista[k] = Left[i]
+            i += 1 # Increments i
+            k += 1 # Increments k
+
+		# If there are elements remaining in Right the they are put here
+        while j < len(Right):
+			# The variable that was remaining is put here
+            lista[k] = Right[j]
+            j += 1 # Increments j
+            k += 1 # Increments k
 
 	return lista
+	# Code was base and taken from GeeksforGeeks
 
 def heapSort(lista):
 	#definan el algoritmo de ordenamiento heapsort