from create_list import create_list_random
#time notation O(n^2)
def insertion_sort(arr):
for i in range(1, len(arr)):
key = arr[i]
j = i-1
while j >= 0 and key < arr[j] :
arr[j + 1] = arr[j]
j -= 1
arr[j + 1] = key
return arr
if __name__=="__main__":
arr = create_list_random(10)
print(insertion_sort(arr))
import time
from create_list import create_list_sorted,create_list_random
#sorting
from bubble_sort import bubble_sort
from insertion_sort import insertion_sort
from merge_sort import merge_sort
from quick_sort import quick_sort
random = []
for i in range(100):
random.append(create_list_random(1000))
t = time.time()
for i in range(100):
bubble_sort(random[i])
time1 = (time.time()-t)/100
print("efficiency of {} is {}s".format("bubble sort",time1))
t = time.time()
for i in range(100):
bubble_sort(random[i])
time1 = (time.time()-t)/100
print("efficiency of {} is {}s".format("insertion sort",time1))
t = time.time()
for i in range(100):
bubble_sort(random[i])
time1 = (time.time()-t)/100
print("efficiency of {} is {}s".format("merge sort",time1))
t = time.time()