fixed and ready to merge

final adjustments to shellsort algorithm

sorting.py

@@ -21,20 +21,22 @@ def quickSort(lista):
 	#definan el algoritmo de ordenamiento quicksort
 	return lista
 
+''' 
+	This algorithm was taken from: https://www.programiz.com/dsa/shell-sort 
+	and was adapted in order to work for this assigment.
+'''
+
 def shellSort(lista):
 	#definan el algoritmo de ordenamiento shellsort
-	# este algoritmo fue tomado de https://www.programiz.com/dsa/shell-sort 
-	# y adaptado para que funcione en este programa.
-	 
-	
-	# determinamos el tamaño de la lista para poder buscar el numero gap. 
+
+	# determening the size of the list and calculates the gap value. 
 	n = len(lista)
 	gap = n // 2
 
 	# this algorithm will run until gap reaches 1 
 	while gap > 0:
 		for i in range(gap, n):
-			temp = lista[i] # storing all items from lista into temp 
+			temp = lista[i] # storing all items from the list into temp 
 			j = i 
 
 			# compares the number in temp with the 0th possition (start of list)