4- Sort the list A[]={ 20, 13,4, 34, 5, 15, 90, 100, 75, 102, 112, 1} a) Using Merge Sort and show the order that the Merge procedure is performed. b) Explain the average case of Merge Sort. Give a detail explanation of how we can estimate the mean in relationship with the worst and best-case scenarios (hint: use the answer for question 3 as a lower-bound for the average).

4- Sort the list A[]={ 20, 13,4, 34, 5, 15, 90, 100, 75, 102, 112, 1} a) Using Merge Sort and show the order that the Merge procedure is performed. b) Explain the average case of Merge Sort. Give a detail explanation of how we can estimate the mean in relationship with the worst and best-case scenarios (hint: use the answer for question 3 as a lower-bound for the average).

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

Question 14 papa .The best method of selecting a kth smallest element from a sequence of n integers is: (a) First Sort these quence by Quick - sort and then select the itemat index ( k - 1 )(b) First Sort these quence by Heap - sort and then select the itemat index ( k - 1 )(c) Use randomized Quick-Select algorithm(d) All of the above(e) None of the above Full explain this question and text typing work only We should answer our question within 2 hours takes more time then we will reduce Rating Dont ignore this line
In every iteration of selection sort, the minimum element (considering ascending order) from the unsorted subarray is picked and moved to the sorted subarray. Select one: True False
ANSWER IN ONE NUMBER/WORD/SENTENCE 1.A sorted array contains 300,000 elements. The maximum number of operations needed by binary search to check if an element is present in the array would be 2.The correct statement indicating the recurrence relation for mergesort is Blank 1 302: T(n) = T(n/2) + n 303: T(n) = 2T(n/2) + n/2 304: T(n) = 2T(n/2) + n 306: T(n) = T(n – 1) + 3n 3.Put the most appropriate statement number here 171: Insertion at the end of an array structure takes O(1) time and insertion at the end of a linked list takes O(n) time. 172: Searching the largest element in a random array takes O(log n) 173: Deletion of first element takes O(1) for an array and O(1) for a linked list 174: Searching for mid element takes O(log n) both for a sorted array and a sorted linked list 4.An array contains following elements: 20 42 8 66 12 39 11 26 33 The mergesort method we discussed in the class calls a merge function. The number of times the merge function is going to be called…
Consider the following code for Merge Sort. public > void sort(T] table) { // BASE CASE - A table with one element is sorted already. if (table.length <= 1) return; // GENERAL CASE - divide-and-conquer int halfSize = table.length/2; // Split table into halves. T[] leftTable = (T[]) new Comparable[halfSize]; T[] rightTable = (T[]) new Comparable[table.length - halfSize]; // copy original data into the two smaller arrays System.arraycopy(table, 0, leftTable, O, halfSize); System.arraycopy(table, halfSize, rightTable, O, table.length - halfSize); sort(leftTable); // recursively sort the left half sort(rightTable); // recursively sort the right half // Merge the halves together back into table merge(table, leftTable, rightTable); } In the class lectures we used sample data with n = 8. The value 8 divides in half very nicely. Suppose the size of the original array is n = 81. How many data items are placed in the LEFT sub-problem? How many data items are placed in the RIGHT sub-problem?…
14. Consider the following list: 8, 14, 40, 52, 60, 65, 2, 90, 23 The first six keys are in order. (9) a. To move 2 to its proper position using the insertion sort as described in this chapter, exactly how many key comparisons are executed? After moving 2 to its proper position, exactly how many compari- sons are executed to move 23 to its proper position.
Create a merge solution based on the following concept that lowers the additional space needed to max(M, N/M): Divide the array into N/M chunks of size M (for the sake of ease, suppose N is a multiple of M). Then, (i) sort the blocks as items with their first key as the sort key, and (ii) cycle through the array combining the first block with the second, then the second block with the third, and so on.
Q-3 Sort the following elements using Selection Sort. 67 34 45 12 23 89 55 9. 60 18 Q-4 Declare and initialize the one dimensional Array. Q-5 Describe different types of Linked List with appropriate diagram. Name of the Course Signature Teacher NOTE: 1. Submit assignment within due date. Late assignment submission will not be allowed. 2. Marks will be given on basis of submitted assignment. 3. Assignment will be accepted through BLACKBOARD portal as only soft copy. 4. The students are open to search from internet or from text book, but expected to write the answer in their own words.
Question No:The recurrence for merge sort is given,T(1)= cT(n)= 2T(n/2) + cn, n > 1Find it’s time complexity using Iteration method.
Consider an array of 6 elements (keys should be alphabets in your name i.e Prashant). Apply merge sort steps manually, and show the changes in array till your whole array is sorted.
Create a diagram showing Merge sort technique. The picture with black background is a sample diagram
SUBJECT : ANALYSIS OF ALGORITHM Consider your name in capital letters (name = AYESHA QAMAR), Apply Merge Sort on your complete name as per enrollment in the university. You are required to elaborate each sub array that are created during the dry run process.
Added PS Merge Sort Given an array of char named theArray with 8 elements. Draw the diagram that shows the detail process of sorting the data in ascendng order using Mergesort technique. Added PS Fill in the table below to show the changes in variable first 1, last 1, first 2, last 2, index and tempArray every time the loops in merge() function is executed. Diagram 9.4 [0] [1] [2] [3] [4] [5] [6] [7] theArray K M F tempArray firstl lastl first2 last2 index (0] [1] [2] [3] [4] [5] [6] [7]