Merge branch 'sortingQuicksort' into sortingFinal

sorting.py

 
 def quickSort(lista):
 	#definan el algoritmo de ordenamiento quicksort
+	elements = len(lista)
+    
+    #Base case
+	if elements < 2:
+		return lista
+    
+	current_position = 0 #Position of the partitioning element
+
+	for i in range(1, elements): #Partitioning loop
+		if lista[i] <= lista[0]:
+			current_position += 1
+			temp = lista[i]
+			lista[i] = lista[current_position]
+			lista[current_position] = temp
+
+	temp = lista[0]
+	lista[0] = lista[current_position] 
+	lista[current_position] = temp #Brings pivot to it's appropriate position
+    
+	left = quickSort(lista[0:current_position]) #Sorts the elements to the left of pivot
+	right = quickSort(lista[current_position+1:elements]) #sorts the elements to the right of pivot
+
+	lista = left + [lista[current_position]] + right #Merging everything together
+
+	
+    
 	return lista