Question

PLEASE HELP ASAP! in Python, I am supposed to create a program that compares insertion sorting and selection sorting. My program only compares insertion and selection once. It is supposed to compare increasing, decreasing and an array of random values for each at 5 different lengths (without looping). Please help me. I have included my code below.

import time

import random

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 = j - 1

        arr[j + 1] = key

def selection_sort(arr):

    for i in range(len(arr)):

        min_index = i

        for j in range(i + 1, len(arr)):

            if arr[min_index] > arr[j]:

                min_index = j

        arr[i], arr[min_index] = arr[min_index], arr[i]

def main():

    arr = [random.randint(1, 10000) for i in range(10000)]

    dup_arr = [num for num in arr]

    start = time.process_time()

    insertion_sort(arr)

    end = time.process_time()

    print('Ten Thousand Increasing Insertion: {:.6f}'.format(end - start))

    start = time.process_time()

    selection_sort(dup_arr)

    end = time.process_time()

    print('Ten Thousand Increasing Selection: {:.6f}'.format(end - start))

    

main()

Answer 1

import time

import random

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 = j - 1
arr[j + 1] = key
def selection_sort(arr):
for i in range(len(arr)):
min_index = i
for j in range(i + 1, len(arr)):
if arr[min_index] > arr[j]:
min_index = j
arr[i], arr[min_index] = arr[min_index], arr[i]
'''
methods that takes individual lengths and test selection and insertion sorts.
display reports
'''
def test_random(length):
arr = [random.randint(1, length) for i in range(length)]
dup_arr = [num for num in arr]
start = time.process_time()
insertion_sort(arr)
end = time.process_time()
print(length,'Random Insertion: {:.6f}'.format(end - start))
start = time.process_time()
selection_sort(dup_arr)
end = time.process_time()
print(length,'Random Selection: {:.6f}'.format(end - start))
def test_increasing(length):
arr = [i for i in range(length)]
dup_arr = [num for num in arr]
start = time.process_time()
insertion_sort(arr)
end = time.process_time()
print(length,'Increasing Insertion: {:.6f}'.format(end - start))
start = time.process_time()
selection_sort(dup_arr)
end = time.process_time()
print(length,'Increasing Selection: {:.6f}'.format(end - start))
def test_decreasing(length):
arr = [i for i in range(length)]
dup_arr = [num for num in arr]
start = time.process_time()
insertion_sort(arr)
end = time.process_time()
print(length,'Decreasing Insertion: {:.6f}'.format(end - start))
start = time.process_time()
selection_sort(dup_arr)
end = time.process_time()
print(length,'Decreasing Selection: {:.6f}'.format(end - start))
'''
call above sort testing methods recursively
with random length.
'''
def test_rec(num_of_times):
if(num_of_times>0):
print("\nTest :",num_of_times,"\n")
test_increasing(random.randint(1,1000))
test_decreasing(random.randint(1,1000))
test_random(random.randint(1,1000))
  
test_rec(num_of_times-1)
def main():
test_rec(5)
main()

Screenshots of code and output.