def sort_array(array, array_size, method='quick'):
if method == 'quick':
quick_sort(array, 0, array_size - 1)
elif method == 'heap':
heap_sort(array)
elif method == 'cocktail':
cocktail_sort(array)
def test_heapsort():
copy = list(array)
sorted = heapsort.heap_sort(array)
copy.sort()
#print(copy)
#print(array)
assert copy == sorted
def StartAlgorithm():
global data
if not data:
return
if algMenu.get() == 'Quick Sort':
quick_sort(data, 0, len(data) - 1, drawData, speedScale.get())
elif algMenu.get() == 'Bubble Sort':
bubble_sort(data, drawData, speedScale.get())
elif algMenu.get() == 'Merge Sort':
merge_sort(data, drawData, speedScale.get())
elif algMenu.get() == 'Heap Sort':
heap_sort(data, drawData, speedScale.get())
drawData(data, ['green' for x in range(len(data))])
def start_algo():
global data
if not data: return
if algoMenu.get() == 'Quick Sort':
quick_sort(data, 0, len(data) - 1, draw_Data, speedScale.get())
elif algoMenu.get() == 'Bubble sort':
bubble_sort(data, draw_Data, speedScale.get())
elif algoMenu.get() == 'Merge Sort':
merge_sort(data, draw_Data, speedScale.get())
elif algoMenu.get() == 'Insertion Sort':
insertion_sort(data, draw_Data, speedScale.get())
elif algoMenu.get() == 'Heap Sort':
heap_sort(data, draw_Data, speedScale.get())
draw_Data(data, ['green' for x in range(len(data))])
from mergesort import merge_sort
from quicksort import quick_sort
from heapsort import heap_sort
items = [random.randint(-50, 100) for i in range(10)]
time0 = time.time()
bubble_sort(items)
time1 = time.time()
insert_sort(items)
time2 = time.time()
merge_sort(items)
time3 = time.time()
quick_sort(items)
time4 = time.time()
heap_sort(items)
time5 = time.time()
items.sort()
time6 = time.time()
print()
print(" typ │ time [ms] ")
print("─────────────────────┼─────────────────────")
print(" Bubble sort │ {:.15f}".format(time1 - time0))
print(" Insertion sort │ {:.15f}".format(time2 - time1))
print(" Merge sort │ {:.15f}".format(time3 - time2))
print(" Quicksort │ {:.15f}".format(time4 - time3))
print(" Heapsort │ {:.15f}".format(time5 - time4))
print(" Timsort │ {:.15f}".format(time6 - time5))
print()
# list2=["TupolevTu-204", 107900, 7200]
# list3=["IlushinIl-62", 280300, 11000]
# list4=["AirbusA310", 164000, 11000]
# list5=["Boeing-737", 52800, 10058]
# list6=["Boeing-777", 242600, 10668]
# frame = pd.DataFrame([list1,list2,list3,list4,list5,list6])
# frame.to_csv('plane.csv',index=False)
def open_csv(csv_file: str):
with open(csv_file) as file:
reader = list(csv.reader(file))
list_of_planes = []
for line in reader:
list_of_planes.append(
plane_info.Plane(line[0], int(line[1]), int(line[2])))
return list_of_planes
if __name__ == '__main__':
plane_list = open_csv("plane.csv")
for plane in plane_list:
print(plane)
print("")
sorted_selection = selection.selection_sort(plane_list)
for plane in sorted_selection:
print(plane)
print("")
heapsort = heapsort.Heapsort()
sorted_heap = heapsort.heap_sort(plane_list)
for plane in sorted_heap:
print(plane)
from selectionsort import selection_sort from mergesort import merge_sort_recursion from heapsort import heap_sort import time import random lst = [random.randint(1, 10**6) for i in range(10000000)] x = time.time() sorted(lst) print(time.time() - x) x = time.time() heap_sort(lst) print(time.time() - x) x = time.time() merge_sort_recursion(lst) print(time.time() - x) x = time.time() insertion_sort(lst) print(time.time() - x) x = time.time() selection_sort(lst)
#!/bin/env python
from makelist import make_list
from mergesort import merge_sort
from heapsort import heap_sort
if __name__ == "__main__":
mylist = make_list(10)
merge_list = mylist.copy()
heap_list = mylist.copy()
print(mylist)
'''
merge_sort(merge_list)
print(merge_list)
print(mylist)
'''
heap_list= [5,4,3,2,1]
heap_sort(heap_list)
print(heap_list)
def heap(array):
result = HS.heap_sort(array, [0, 0])
return result
