def bubble_sort(d):
vis = Visualize(d)
vis.bubble_sort() # Starting frame
length = len(d)
for p in range(length):
for i in range(length - p - 1):
vis.bubble_sort(highlight_0=i, highlight_1=i + 1)
if d[i] > d[i + 1]:
d[i], d[i + 1] = d[i + 1], d[i]
vis.bubble_sort() # Finished frame
vis.create_gif('bubble_sort')
def start_merge_sort(d):
vis = Visualize(d)
vis.merge_sort()
print(*merge_sort(d, vis))
vis.merge_sort()
vis.create_gif('merge_sort')
def quick_sort(d):
vis = Visualize(d)
vis.quick_sort(d, -1, -1, -1, -1, -1)
re_quick_sort(d, 0, len(d) - 1, vis)
vis.quick_sort(d, -1, -1, -1, -1, -1)
vis.create_gif('quick_sort')