|
@@ -19,10 +19,69 @@ Al final se imprimen los promedios de cada algortimo
|
19
|
19
|
from random import randint
|
20
|
20
|
import time
|
21
|
21
|
|
|
22
|
+
|
|
23
|
+
|
|
24
|
+
|
|
25
|
+
|
|
26
|
+
|
|
27
|
+def heapify(listaHeap, largoLista, i):
|
|
28
|
+ largest = i
|
|
29
|
+ left = 2 * i + 1
|
|
30
|
+ right = 2 * i + 2
|
|
31
|
+
|
|
32
|
+ if left < largoLista and listaHeap[i] < listaHeap[left]:
|
|
33
|
+ largest = left
|
|
34
|
+
|
|
35
|
+ if right < largoLista and listaHeap[largest] < listaHeap[right]:
|
|
36
|
+ largest = right
|
|
37
|
+
|
|
38
|
+
|
|
39
|
+def merge(lista, p, q, r):
|
|
40
|
+ left = lista[p:q+1]
|
|
41
|
+ right = lista[q+1:r+1]
|
|
42
|
+ i = 0
|
|
43
|
+ j = 0
|
|
44
|
+ k = p
|
|
45
|
+
|
|
46
|
+
|
|
47
|
+ while i < len(left) and j < len(right):
|
|
48
|
+ if left[i] <= right[j]:
|
|
49
|
+ lista[k] = left[i]
|
|
50
|
+ i += 1
|
|
51
|
+ else:
|
|
52
|
+ lista[k] = right[j]
|
|
53
|
+ j += 1
|
|
54
|
+
|
|
55
|
+ k += 1
|
|
56
|
+
|
|
57
|
+
|
|
58
|
+ while i < len(left):
|
|
59
|
+ lista[k] = left[i]
|
|
60
|
+ i += 1
|
|
61
|
+ k += 1
|
|
62
|
+
|
|
63
|
+
|
|
64
|
+ while j < len(right):
|
|
65
|
+ lista[k] = right[j]
|
|
66
|
+ j += 1
|
|
67
|
+ k += 1
|
|
68
|
+
|
|
69
|
+
|
|
70
|
+def mergeSortAux(lista, p, r):
|
|
71
|
+
|
|
72
|
+ if p >= r:
|
|
73
|
+ return
|
|
74
|
+
|
|
75
|
+ q = int((p+r)/2)
|
|
76
|
+ mergeSortAux(lista, p, q)
|
|
77
|
+ mergeSortAux(lista, q+1, r)
|
|
78
|
+ merge(lista, p, q, r)
|
|
79
|
+
|
|
80
|
+
|
22
|
81
|
def mergeSort(listaMerge):
|
23
|
82
|
|
24
|
|
-
|
25
|
|
- return lista
|
|
83
|
+ mergeSortAux(listaMerge, 0, len(listaMerge)-1)
|
|
84
|
+ return listaMerge
|
26
|
85
|
|
27
|
86
|
|
28
|
87
|
|