Updated the algorithm

Made changes to the algorithm so that it can run better.

sorting.py

@@ -23,33 +23,28 @@ def quickSort(lista):
 
 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. 
 	n = len(lista)
 	gap = n // 2
 
-	# comienza el algoritmo
+	# this algorithm will run until gap reaches 1 
 	while gap > 0:
-		j = gap
-
-		while j < n: 
-			i = j - gap 
-			
-			while i >= 0: 
-				if lista[i+gap] > lista[i]:
-					break
-                
-				else:
-					lista[i+gap], lista[i] = lista[i], lista[i+gap]
-					
-				i=i-gap # To check left side also
-                            # If the element present is greater than current element 
-							
-			
-			j+=1
-			
-		# se disminuye el gap
-		gap = gap // 2 
+		for i in range(gap, n):
+			temp = lista[i] # storing all items from lista into temp 
+			j = i 
+
+			# compares the number in temp with the 0th possition (start of list)
+			# if temp is larger than the first element then we swap them
+			while j >= gap and lista[j - gap] > temp: 
+				lista[j] = lista[j - gap]
+				j -= gap
+
+			lista[j] = temp
+		gap = gap // 2 # decreases the gap to continue the loop 
 
 	return lista