i. In Block 2 Part 6, you saw that selection sort requires about (n-1)²/2 comparisons to sort a list of length n. In fact, the exact number of comparisons required by selection sort to sort a list of length n is nx (n-1)/2. Use this formula to calculate the total number of comparisons required to sort two lists each of length 100. ii. Once the two lists have been sorted, they need to be merged. Suggest a reason why the maximum number of comparisons required to merge two lists, each of length 100, is 199. iii. Hence, find the maximum total number of comparisons required to sort two lists of length 100 using Strategy B.

i. In Block 2 Part 6, you saw that selection sort requires about (n-1)²/2 comparisons to sort a list of length n. In fact, the exact number of comparisons required by selection sort to sort a list of length n is nx (n-1)/2. Use this formula to calculate the total number of comparisons required to sort two lists each of length 100. ii. Once the two lists have been sorted, they need to be merged. Suggest a reason why the maximum number of comparisons required to merge two lists, each of length 100, is 199. iii. Hence, find the maximum total number of comparisons required to sort two lists of length 100 using Strategy B.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter16: Searching, Sorting And Vector Type

Section: Chapter Questions

Problem 16SA

See similar textbooks

Similar questions

Consider a list L = {387, 690, 234, 435, 567, 123, 441}. Here, the number ofelements n = 7, the number of digits l = 3 and radix r = 10. This means that radixsort would require 10 bins and would complete the sorting in 3 passes. illustrates the passes of radix sort over the list. It is assumed that each key is thrown into the bin face down. At the end of each pass, when the keys are collected from each bin in order, the list of keys in each bin is turned upside down to be appended to the output list
You are required to investigate the number of comparisons that take place during the execution of an insertion sort. Given a list of ?N unsorted integers, use insertion sort to count the number of comparisons that it takes to arrive at the sorted list. Your insertion sort should execute from left to right. Function specifications Argument(s): integers (list) →→ a list of unsorted integers. Return: comparisons (int) →→ return the number of comparisons made to arrive at the sorted list. ### START FUNCTIONdef insertion_sort(integers): ### END FUNCTION integers = [15, 1, 2, 16, 12, 16, 9, 2, 0, 11]insertion_sort(integers.copy())
Q1)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. Q2)Consider an array consisting of the following sequence: 1, 4, 9, 16, 25, 49, …, n Suppose a number in the sequence is missing. Write the mathematical process to find the missing number, i.e. some equation. What is the time complexity of finding the missing number in the sequence? Q3)Sort the text “SARHAD UNIVERSITY” in ascending order using the insertion sort algorithm. Discuss also the best, worst and average case complexity of the…
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.
A merge sort is used to sort an array of 1000 test scores in descending order. Which of the following statements is true?a) The sort is fastest if the original test scores are sorted from smallest to largestb) The sort is fastest if the original test scores are in completely sorted order.c) The sort is fastest if the original test scores are sorted from largest to smallest.d) The sort is the same, no matter what the order of the original elements.
a. Write a version of the sequential search algorithm that can be used to search a sorted list. (1, 2) b. Consider the following list: 2, 20, 38, 41, 49, 56, 62, 70, 88, 95, 100, 135, 145 Using a sequential search on ordered lists, that you designed in (a), how many comparisons are required to determine whether the following items are in the list? (Recall that comparisons mean item comparisons, not index comparisons.) (1, 2) 2 57 88 70 135 Write a program to test the function you designed. Note: Have the function,seqOrdSearch, return -1 if the item is not found in the list. (return the index of the item if found).
Consider the following list:18, 8, 38, 25, 45, 12, 74, 60, 30a. This list is to be sorted using the insertion sort algorithm . Show the list after five iterations of the for loop.b. Exactly how many key comparisons are executed during the first fiveiterations of the for loop?
Run numerical tests to ensure that the page 32 shuffling code performs as expected. Create a program called ShuffleTest that accepts the command-line arguments M and N, performs N array shuffles of size M that are initialized with a[i] = i before each shuffle, and prints an M-by-M table where row i indicates how many times i ended up in place j for all j. The array's entries should all be relatively near to N/M.
Following is the partition function for quicksort, where we have used the leftmost number as a pivot. Assume that our array, ARR = {14, 8, 7, 38, 22, 15, 9}, which is 7 in size. What will be the array ARR after we apply "partition(A, 0, 6)"* 9, 15, 22, 38, 7, 8, 14 7, 8, 9, 14, 15, 22, 38 9, 8, 14, 7, 22, 15, 38 9, 8, 7, 14, 22, 15, 38 7, 9, 15, 22, 38, 14, 6 38, 22, 15, 14, 9, 8, 7
To get the necessary excess space down to max(M, N/M), create a merging implementation based on the following concept: Divide the array into N/M blocks of size M in order to keep things simple, and assume that N is a multiple of M. The blocks are then (i) sorted using selection sort, which treats them as items and uses their first key as the sort key, and (ii) merged as the array is iterated through. The first block is merged with the second, the second block with the third, and so on.
Use C++ Programming language Write a function that merges two sorted array-based lists into one sorted array-based list. The function takes two arrays as parameters, each holding a sorted list of integers, merges them into a single sorted list, and returns the result. Note that this function performs the merge part of the merge sort algorithm. The function should have a linear time complexity i.e. O(N), where N is the sum of the length of the two input lists it merges. Deliverables: A copy of your merge function code in a text file. A copy of a test program to test your function. Be sure to test all cases e.g. two empty lists, one empty only, lists with 1 element each, lists with multiple elements. Screenshots of your test runs showing your function meets specifications.
In the Mergesort, the idea is to merge two arrays or list of two numbers, where each of those arrays are sorted. The merged array becomes fully sorted. The following code snippet makes the process of merge happen. Assume an array A={4, 11, 2, 9, 6}, where we want to split that array and then merge it. If we call the function "merge(A, 0, 2, 4)", how would the array A look like after the merge operation?* 4, 11, 2, 9, 6 2, 4, 6, 9, 11 4, 11, 9, 2, 6 4, 11, 6, 9, 2 11, 9, 6, 4, 2 4, 9, 6, 11, 2