Added merge algorithm

sorting.py

@@ -80,7 +80,7 @@ for i in range(veces):
 	quicklista = deepcopy(mergelista)
 	searchlista = deepcopy(mergelista)
 
-	with recursion_depth(1500): # This function excedes python's recursion limit
+	with recursion_depth(1100): # This function excedes python's recursion limit
 		acumulaMerge += timeCode(lambda: mergeSort(mergelista))[0]
 
 	acumulaHeap += timeCode(lambda: heapSort(heaplista))[0]