def caso_peor(arch): fp = open(arch, "w") for n in range(1, maxn + 1): A = list(range(n, 0, -1)) t0 = time.time() merge_sort.ordenar2(A) fp.write("{} {}\n".format(n, time.time() - t0)) fp.close()
def caso_peor(arch): fp = open(arch, "w") for n in range(1, maxn + 1): A = list(range(n, 0, -1)) merge_sort.pasos = 0 merge_sort.ordenar2(A) fp.write("{} {}\n".format(n, merge_sort.pasos)) fp.close()
def caso_promedio(arch): fp = open(arch, "w") for n in range(1, maxn + 1): A = [randrange(1000) for _ in range(n)] t0 = time.time() merge_sort.ordenar2(A) fp.write("{} {}\n".format(n, time.time() - t0)) fp.close()
def caso_promedio(arch): fp = open(arch, "w") for n in range(1, maxn + 1): A = [randrange(1000) for _ in range(n)] merge_sort.pasos = 0 merge_sort.ordenar2(A) fp.write("{} {}\n".format(n, merge_sort.pasos)) fp.close()
def caso_peor(arch): fp = open(arch, "w") for n in range(1, maxn + 1): A = list(range(n, 0, -1)) t0 = time.time() merge_sort.ordenar2(A) fp.write("{} {}\n".format(n, time.time()-t0)) fp.close()
def caso_promedio(arch): fp = open(arch, "w") for n in range(1, maxn + 1): A = [randrange(1000) for _ in range(n)] t0 = time.time() merge_sort.ordenar2(A) fp.write("{} {}\n".format(n, time.time()-t0)) fp.close()