def sort():
global data
timeTick = set_speed()
if algo_menu.get() == 'Bubble Sort':
bubble_sort(data, drawData, timeTick)
elif algo_menu.get() == 'Merge Sort':
merge_sort(data, 0, len(data)-1, drawData, timeTick)
def sort():
global data
timeTick = set_speed()
if algo_menu.get() == 'Bubble Sort':
bubble_sort(data, drawData, timeTick)
elif algo_menu.get() == 'Selection Sort':
selection_sort(data, drawData, timeTick)
elif algo_menu.get() == 'Insertion Sort':
insertion_sort(data, drawData, timeTick)
elif algo_menu.get() == 'Merge Sort':
merge_sort(data, 0, len(data) - 1, drawData, timeTick)
elif algo_menu.get() == 'Quick Sort':
quick_sort(data, 0, len(data) - 1, drawData, timeTick)
elif algo_menu.get() == 'Heap Sort':
heap_sort(data, drawData, timeTick)
else:
counting_sort(data, drawData, timeTick)