Python pleasecompare_sorts.pyimport random #Import module for generating random numbersimport time #Import module for getting the current 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 functions# See Canvas assignment for details.main() Use the starter-code compare_sorts.py to write a main() function that compares thespeed of three sorting algorithms. The sorting algorithms are provided as threefunctions. Do not edit the sorting functions. Only edit the main() function. Addcode to the main() function as follows:• The starter-code imports two modules: random and time. As you know, therandom module has functions for generating random numbers. The time moduleprovides the function time.time() which returns the current time.• Use the predefined global variable maxvalue to create a random list of maxvalueintegers between 1 and maxvalue. Call time.time() to get the start time and save it ina variable, then call merge.sort() to sort the list, then call time.time() again to get theend time. The elapsed time will be the end time minus the start time. Print theelapsed time for merge_sort() to sort the list.• Generate a new random list using the same maxvalue and measure and print thetime for the insertion_sort to sort the list.• Generate a new random list using the same maxvalue and measure and print thetime for the bubble_sort to sort the list.run the program several times with thesedifferent values of maxvalue: 100, 1000, 10000, and 100000. For each value ofmaxvalue, write down the time required for each sorting algorithm, then using a texteditor, hand-type the times into a results.txt file.Hint: Some of the sorting algorithms take a really long time to sort 100000 numbers.Be patient. Get a snack or something while you wait for them to finish.

Python please compare_sorts.py import random #Import module for generating random numbers import time #Import module for getting the current 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 # See Canvas assignment for details. main()

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

Python please

compare_sorts.py

import random #Import module for generating random numbers
import time #Import module for getting the current 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
# See Canvas assignment for details.
main()

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 3 steps with 5 images

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.