Fill out the python code 1 def read_nums():6000 SAWNP23456789131410 def swap(nums, n, m):1112151617182219NE2728293031234 35 36 37"""Read numbers from input and return them in a list"""return [int(num) for num in input().split()]2021222324 if __name__ == '__main__':252633def print_nums (nums):"""Output numbers, separating each item by a spaces;no space or newline before the first number or after the last."""print('.join([str(n) for n in nums]), end='')37"""Exchange nums [n] and nums [m]""nums [n], nums [m] = nums [m], nums [n]def insertion_sort (numbers):"""Sort the list numbers using insertion sort"""|for i in range(1, len(numbers)):j = i# Insert numbers [i] into sorted part# stopping once numbers [i] is in correct positionwhile j> 0 and numbers [j] < numbers [j - 1]:swap(numbers, j, j - 1)j -= 1#Step 1: Read numbers into a listnumbers read_nums ()# Step 2: Output the numbers listprint_nums (numbers);print(end='\n\n')# Step 3: Sort the numbers listinsertion_sort(numbers)print()# Step 4: TODO: Output the number of comparisons and swaps performed The script has four steps:1. Read a list of integers (no duplicates).2. Output the numbers in the list.3. Perform an insertion sort on the list.4. Output the number of comparisons and swaps performed during the insertion sort.Steps 1 and 2 are provided in the script.Implement step 3 based on the insertion sort algorithm in the book. Modify insertion_sort() to:• Count the number of comparisons performed.Count the number of swaps performed.• Output the list during each iteration of the outside loop.Implement step 4 at the end of the script.Hints: In order to count comparisons and swaps, modify the while loop in insertion_sort(). Use global variables for comparisons and swaps.The script includes three helper functions:• read_nums() # Read and return a list of integers.• print_nums(nums) # Output the numbers in numsswap(nums, n, m) # Exchange nums[n] and nums[m]Ex: When the input is:3 2 1 598the output is:3 2 1 5 9 82 3 1 5 9 81 2 3 5 9 81 2 3 5 9 81 2 3 5 9 81 2 3 5 8 9comparisons: 7swaps: 4

The Python code is given below with output screenshot

The script has four steps: 1. Read a list of integers (no duplicates). 2. Output the numbers in the list. 3. Perform an insertion sort on the list. 4. Output the number of comparisons and swaps performed during the insertion sort. Steps 1 and 2 are provided in the script. Implement step 3 based on the insertion sort algorithm in the book. Modify insertion_sort() to: • Count the number of comparisons performed. • Count the number of swaps performed. Output the list during each iteration of the outside loop. Implement step 4 at the end of the script. Hints: In order to count comparisons and swaps, modify the while loop in insertion_sort(). Use global variables for comparisons and swaps. The script includes three helper functions: • read_nums() # Read and return a list of integers. • print_nums(nums) # Output the numbers in nums • swap(nums, n, m) # Exchange nums[n] and nums[m] Ex: When the input is: 3 2 1 598 the output is: 3 2 1598 231598 1 2 3 5 9 8 1 2 3 5 9 8 1 2 3 5 9 8 1 2 3 5 8 9 comparisons: 7 swaps: 4

The script has four steps: 1. Read a list of integers (no duplicates). 2. Output the numbers in the list. 3. Perform an insertion sort on the list. 4. Output the number of comparisons and swaps performed during the insertion sort. Steps 1 and 2 are provided in the script. Implement step 3 based on the insertion sort algorithm in the book. Modify insertion_sort() to: • Count the number of comparisons performed. • Count the number of swaps performed. Output the list during each iteration of the outside loop. Implement step 4 at the end of the script. Hints: In order to count comparisons and swaps, modify the while loop in insertion_sort(). Use global variables for comparisons and swaps. The script includes three helper functions: • read_nums() # Read and return a list of integers. • print_nums(nums) # Output the numbers in nums • swap(nums, n, m) # Exchange nums[n] and nums[m] Ex: When the input is: 3 2 1 598 the output is: 3 2 1598 231598 1 2 3 5 9 8 1 2 3 5 9 8 1 2 3 5 9 8 1 2 3 5 8 9 comparisons: 7 swaps: 4

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

Similar questions

TRUE or FALSE? Suppose you have been given a sorted list of 100 names and needed to find a particular name in that list. Using binary search, it is possible that you might have to look at every location in list before finding the desired name
Q2: a. Write an algorithm that searches a sorted list of n items by dividing it into three sublists of almost n/3 items. This algorithm finds the sublist that might contain the given item and divides it into three smaller sublists of almost equal size. The algorithm repeats this process until it finds the item or concludes that the item is not in the list. Dry run the above algorithm to find the value 240. A[] = {10,15,20,60,65,110,150,220,240,245,260,290,300,460,470,501}
Q: Suppose you are given an array A of n elements. Your task is to sort n numbers stored in array A by reading the first element of A and placing it on its original position (position after sorting). Then read the second element of A, and place it on its original position. Continue in this manner for the first n-1 elements of A. What type of sorting is this? Write the algorithm and also mention the name of this sorting algorithm. What loop invariant does this algorithm maintain? Give the best-case and worst-case running times of this sorting algorithm.
Using c++ Create this program in this given instructions. Using a random number generator, create a list of 500 integers. Perform a benchmark analysis using some of the sorting algorithms from this chapter. What is the difference in execution speed? Implement the bubble sort using simultaneous assignment. A bubble sort can be modified to “bubble” in both directions. The first pass moves “up” the list, and the second pass moves “down.” This alternating pattern continues until no more passes are necessary. Implement this variation and describe under what circumstances it might be appropriate.
the list has the following items 17 9 11 30 8 20 35 7 5 45 3 28 Apply the quick sort on the above list by using the pivot is always the left item and find the following The list after a first partition call
Q1: Suppose you are given an array A of n Your task is to sort n numbers stored in array A by reading the first element of A and placing it on its original position (position after sorting). Then read the second element of A, and place it on its original position. Continue in this manner for the first n-1 elements of A. What type of sorting is this? Write the algorithm and also mention the name of this sorting algorithm. What loop invariant does this algorithm maintain? Give the best-case and worst-case running times of this sorting algorithm.
Merge and quick sort Implementation – Directed Lab Work1. Complete the recursive algorithm for merge sort part in the given data file, ArraySortRecursive.java. 2. Complete the implementation of quick sort by implementing the method partition in thegiven data file, ArraySortRecursive.java.3. Save the file as ArraySortRecursiveYourlastname.java. 4. Save the test driver program as DriverYourlastname.java and run the program and verify.
Given the unsorted list [6, 5, 4, 3, 7, 1, 2], show what the contents of the listwould be after each iteration of the loop as it is sorted using the following:a. Selection sortb. Insertion sort
* allSame returns true if all of the elements in list have the same value. * allSame returns false if any two elements in list have different values. * The array may be empty and it may contain duplicate values. * * Your solution should contain at most one loop. You may not use recursion. * Your solution must not call any other functions. * Here are some examples (using "==" informally): * * * * * * * * true == allSame (new double[] { }) true == allSame(new double[] {11}) true == allSame (new double[] { 11, 11, 11, 11 }) false == allSame(new double[] { 11, 11, 11, 22 }) false == allSame (new double[] { 11, 11, 22, 11 }) true == allSame (new double[] { 22, 22, 22, 22 }) * */ public static boolean allSame (double[] list) { return StdRandom.bernoulli(); //TODO: fix this
Binary Search of Strings1. Write a version of the selection sort algorithm presented in the unit, which is usedto search a list of strings.2. Write a version of the binary search algorithm presented in the unit, which isused to search a list of strings. (Use the selection sort that you designed aboveto sort the list of strings.)3. Create a test program that primes the list with a set of strings, sorts the list, andthen prompts the user to enter a search string. Your program should then searchthe list using your binary search algorithm to determine if the string is in the list.Allow the user to continue to search for strings until they choose to exit theprogram
Python code pls! 14.9 LAB: Insertion sort The script has four steps: Read a list of integers (no duplicates). Output the numbers in the list. Perform an insertion sort on the list. Output the number of comparisons and swaps performed during the insertion sort. Steps 1 and 2 are provided in the script. Implement step 3 based on the insertion sort algorithm in the book. Modify insertion_sort() to: Count the number of comparisons performed. Count the number of swaps performed. Output the list during each iteration of the outside loop. Implement step 4 at the end of the script. Hints: In order to count comparisons and swaps, modify the while loop in insertion_sort(). Use global variables for comparisons and swaps. The script includes three helper functions: read_nums() # Read and return a list of integers. print_nums(nums) # Output the numbers in nums swap(nums, n, m) # Exchange nums[n] and nums[m] Code that I need to modify(this is the given format, and I have to edit it…
Home Asagnment Write a program that should create a single link list and it should insert and delete nodes from link list. Write an algorithm that should concatenate three link lists into one link list. Write an algorithm that should split a single link list into three link list. Assume that initial link list has 30 nodes. Write an algorithm that should count nodes with even values. Write an algorithm that should sort values of nodes of link list. Write an algorithm that should delete duplicate nodes from link list. Write an algorithm that should delete all nodes from link list. Write an algorithm that should reverse data of all nodes of link list.