|
@@ -24,14 +24,14 @@ from heap import heap
|
24
|
24
|
def mergeSort(lista, l, r):
|
25
|
25
|
if l < r:
|
26
|
26
|
|
27
|
|
- # Same as (l+r)//2, but avoids overflow for
|
28
|
|
- # large l and h
|
29
|
|
- m = l+(r-l)//2
|
|
27
|
+ # Same as (l+r)//2, but avoids overflow for
|
|
28
|
+ # large l and h
|
|
29
|
+ m = l+(r-l)//2
|
30
|
30
|
|
31
|
|
- # Sort first and second halves
|
32
|
|
- mergeSort(lista, l, m)
|
33
|
|
- mergeSort(lista, m+1, r)
|
34
|
|
- merge(lista, l, m, r)
|
|
31
|
+ # Sort first and second halves
|
|
32
|
+ mergeSort(lista, l, m)
|
|
33
|
+ mergeSort(lista, m+1, r)
|
|
34
|
+ merge(lista, l, m, r)
|
35
|
35
|
|
36
|
36
|
def heapSort(lista):
|
37
|
37
|
|
|
@@ -95,7 +95,3 @@ print ("MergeSort " + str(acumulaMerge/veces) + " segundos")
|
95
|
95
|
print ("HeapSort " + str(acumulaHeap/veces) + " segundos")
|
96
|
96
|
print ("QuickSort " + str(acumulaQuick/veces) + " segundos")
|
97
|
97
|
print ("ShellSort " + str(acumulaShell/veces) + " segundos")
|
98
|
|
-<<<<<<< HEAD
|
99
|
|
-
|
100
|
|
-=======
|
101
|
|
->>>>>>> a2416a1f1584bddc699e3c6dfe5efdd25f2ac172
|