In python3!!!starter-code compare_sort_algorithms.py：import randomimport timemaxvalue = 1000def merge(left, right):result = []left_idx, right_idx = 0, 0while left_idx < len(left) and right_idx < len(right):# to change direction of sort, change direction of comparisonif left[left_idx] <= right[right_idx]:result.append(left[left_idx])left_idx += 1else:result.append(right[right_idx])right_idx += 1if left:result.extend(left[left_idx:])if right:result.extend(right[right_idx:])return resultdef merge_sort(m):if len(m) <= 1:return mmiddle = len(m) // 2left = m[:middle]right = m[middle:]left = merge_sort(left)right = merge_sort(right)return list(merge(left, right))def insertion_sort(array):for slot in range(1, len(array)):value = array[slot]test_slot = slot - 1while test_slot > -1 and array[test_slot] > value:array[test_slot + 1] = array[test_slot]test_slot = test_slot - 1array[test_slot + 1] = valuereturn arraydef bubble_sort(array):index = len(array) - 1while index >= 0:for j in range(index):if array[j] > array[j + 1]:array[j], array[j + 1] = array[j + 1], array[j]index -= 1return arraydef main():#ADD CODE to compare the three list-sorting functionsmain() import randomimport time3124maxvalue10006 - def merge(left, right):7resultleft_idx, right_idxwhile left_idx < len(left) and right_idx < len(right):80, 09.# to change direction of sort, change direction of comparisonif left[left_idx] <=result.append(left[left_idx])left_idx += 1else:result.append(right[right_idx])right_idx += 11011right[right_idx]:121314 -1516if left:result.extend(left[left_idx:])if right:result.extend(right[right_idx:])return result171819202122def merge_sort(m):if len(m)2324<= 1:25return m26len(m) // 2m[:middle]m[middle:]27middle28left29right30merge_sort(left)merge_sort(right)return list(merge(left, right))31left32right3334def insertion_sort(array):for slot in range(1, len(array)):value3536 -37array[slot]38test_slotslot1while test_slotarray[test_slot + 1]test_slot-1 and array[test_slot] > value:array[test_slot]394041test_slot- 142array[test_slot + 1]value43return array4445 - def bubble_sort(array):46index =len(array)147 -while index >= 0:48 -49 -for j in range(index):if array[j] > array[j + 1]:50array[j], array[j + 1]array[j + 1], array[j]51index152return array5354 - def main():55#ADD CODE to compare the three list-sorting functions56 main() Practice writing code to compare three different sorting algorithms.Section 1.Write a main() function that compares the speed of three sorting algorithms using thestarter-code compare_sort_algorithms.py. The sorting algorithms are provided as threefunctions. You should not edit the sorting functions. You can only edit the main()function. Write additional code to the main() function as follows:Use the global variable maxvalue to generate a random list of maxvalue integers between1 and maxvalue* , call time.time() to get the start time and save it in a variable, then call themerge_sort() function to sort the list, then call time.time() again to get the end time. Theelapsed time will be the end time minus the start time. Print the elapsed time for themerge_sort to sort the list.• Create a new random list using the same maxvalue and similarly measure the time forthe insertion_sort to sort the list.Create a new random list using the same maxvalue and similarly measure the time forthe bubble_sort to sort the list.Section 2.If you have completed Section 1, run the program multiple times using the following valuesof maxvalue: 100, 1000, 10000, and 100000. For each value of maxvalue, write down thetime required for each sorting algorithm and enter it into the results.txt file by hand using atext editor.

sorting algorithms Time complexity Merge Sort · This divide and conquer…

Answered: n python3!!! starter-code…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

100%

In python3!!!

starter-code compare_sort_algorithms.py：

import random
import time

maxvalue = 1000

def merge(left, right):
result = []
left_idx, right_idx = 0, 0
while left_idx < len(left) and right_idx < len(right):
# to change direction of sort, change direction of comparison
if left[left_idx] <= right[right_idx]:
result.append(left[left_idx])
left_idx += 1
else:
result.append(right[right_idx])
right_idx += 1
if left:
result.extend(left[left_idx:])
if right:
result.extend(right[right_idx:])
return result

def merge_sort(m):
if len(m) <= 1:
return m

middle = len(m) // 2
left = m[:middle]
right = m[middle:]

left = merge_sort(left)
right = merge_sort(right)
return list(merge(left, right))

def insertion_sort(array):
for slot in range(1, len(array)):
value = array[slot]
test_slot = slot - 1
while test_slot > -1 and array[test_slot] > value:
array[test_slot + 1] = array[test_slot]
test_slot = test_slot - 1
array[test_slot + 1] = value
return array

def bubble_sort(array):
index = len(array) - 1
while index >= 0:
for j in range(index):
if array[j] > array[j + 1]:
array[j], array[j + 1] = array[j + 1], array[j]
index -= 1
return array

def main():
#ADD CODE to compare the three list-sorting functions

main()

import random
import time
3
1
2
4
maxvalue
1000
6 - def merge(left, right):
7
result
left_idx, right_idx
while left_idx < len(left) and right_idx < len(right):
8
0, 0
9.
# to change direction of sort, change direction of comparison
if left[left_idx] <=
result.append(left[left_idx])
left_idx += 1
else:
result.append(right[right_idx])
right_idx += 1
10
11
right[right_idx]:
12
13
14 -
15
16
if left:
result.extend(left[left_idx:])
if right:
result.extend(right[right_idx:])
return result
17
18
19
20
21
22
def merge_sort(m):
if len(m)
23
24
<= 1:
25
return m
26
len(m) // 2
m[:middle]
m[middle:]
27
middle
28
left
29
right
30
merge_sort(left)
merge_sort(right)
return list(merge(left, right))
31
left
32
right
33
34
def insertion_sort(array):
for slot in range(1, len(array)):
value
35
36 -
37
array[slot]
38
test_slot
slot
1
while test_slot
array[test_slot + 1]
test_slot
-1 and array[test_slot] > value:
array[test_slot]
39
40
41
test_slot
- 1
42
array[test_slot + 1]
value
43
return array
44
45 - def bubble_sort(array):
46
index =
len(array)
1
47 -
while index >= 0:
48 -
49 -
for j in range(index):
if array[j] > array[j + 1]:
50
array[j], array[j + 1]
array[j + 1], array[j]
51
index
1
52
return array
53
54 - def main():
55
#ADD CODE to compare the three list-sorting functions
56 main()

Expert Solution

Step by step

Solved in 4 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.