Answer the following regarding Merge Sort:[Select1. Merge Sort requires an additional space (apart from the input array) of size[Select]2. Suppose the function MergeSort() is a recursive implementation of the meOln)as(Select]Ollog n)MergeSort() recursively called, if A is of size n? Answer.

Merge sort works on the principle of Divide and Conquer. It repeatedly breaks down a list into…

Answer the following regarding Merge Sort: Select 1. Merge Sort requires an additional space (apart from the input array) of size [Select] O(1) 2. Suppose the function MergeSort() is a recursive implementation of the me Oin) Ollog n) MergeSort( ) recursively called, if A is of size n? Answer. Select

Answer the following regarding Merge Sort: Select 1. Merge Sort requires an additional space (apart from the input array) of size [Select] O(1) 2. Suppose the function MergeSort() is a recursive implementation of the me Oin) Ollog n) MergeSort( ) recursively called, if A is of size n? Answer. Select

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

2. Suppose the function MergeSort( Vis a recursive implementation of the merge sort algorithm, which takes as input an integer array A. How many times is MergeSort( ) recursively called, if A is of size n? Answer: Select T Select Olnlogn 3. How many times is the Merge routine called in total, O(1) Oln 2) nswer. ISelect ]
Consider the following problems for recursive definition/solution. Answer the following questions. [Remember that a recursive definition/solution requires base case and recursive case] Consider a list of numbers A {55,12,53,56,24,1,7,42}. Sort is by using Merge Sort. Show each step in dividing the list and conquering/combining it.
Identify the recursive functions from the given code and give reasons why these functions are recursive. void mergeSort(int a[],int p,int r) { int q; if(p<r) { q=(p=r)/2; mergeSort(a, p, q); mergeSort(a, q+1, r); merge(a, p, q, r); } } void merge(inta[], int p, int q, int r) { int b[5]; int i, j, k; k=0; i=p; j=q+1; while(i<=q&&j<=r) { if(a[i]<a[j]) b[k++]=a[i++]; else b[k++]=a[j++]; } while(<,=q) b[k++]=a[i++]; while(j<=r) b[k++]=a[i++]; for(i=r;i>=p;i--) a[i]=b[--k]; }
Q: Modify the following algorithm of Merge Sort in such a way that during every recursive call it should divide the array into three partitions instead of two. What will be effect of this modification on the running time of Merge Time? Merge-Sort (A, left, right) if left ≥ right return else middle ← (left+right)/2 Merge-Sort(A, left, middle) Merge-Sort(A, middle+1, right) Merge(A, left, middle, right) Merge(A, left, middle, right) n1 ← middle – left + 1 n2 ← right – middle create array L[n1], R[n2] for i ← 0 to n1-1 do L[i] ← A[left +i] for j ← 0 to n2-1 do R[j] ← A[middle+j] k ← i ← j ← 0 while i< n1 & j< n2 if L[i] < R[j] A[k++] ← L[i++] else A[k++] ← R[j++] while i< n1 A[k++] ← L[i++] while j < n2 A[k++] ← R[j++]
Java Merge Sort but make it read the data 12, 11, 13, 5, 6, 7 from a file not an array /* Java program for Merge Sort */ class MergeSort { // Merges two subarrays of arr[]. // First subarray is arr[l..m] // Second subarray is arr[m+1..r] void merge(int arr[], int l, int m, int r) { // Find sizes of two subarrays to be merged int n1 = m - l + 1; int n2 = r - m; /* Create temp arrays */ int L[] = new int[n1]; int R[] = new int[n2]; /*Copy data to temp arrays*/ for (int i = 0; i < n1; ++i) L[i] = arr[l + i]; for (int j = 0; j < n2; ++j) R[j] = arr[m + 1 + j]; /* Merge the temp arrays */ // Initial indexes of first and second subarrays int i = 0, j = 0; // Initial index of merged subarray array int k = l; while (i < n1 && j < n2) { if (L[i] <= R[j]) { arr[k] = L[i];…
Modify the following algorithm of Merge Sort in such a way that during every recursive call it should divide the array into three partitions instead of two. What will be effect of this modification on the running time of Merge Time? Merge-Sort (A, left, right) if left z right return else middle < (left+right)/2 Merge-Sort(A, left, middle) Merge-Sort(A, middle+1, right) Merge(A, left, middle, right) Merge(A, left, middle, right) n. + middle - left +1 nz+ right – middle create array L[n:], R[n2] fori< 0 to n,-1 do L[j] < A[left +i] forj+ 0 to nz-1 do R[j] < A[middleti] while ik n, &j< n2 if L[] < R[j] A[k++] + L[i++] else A[k++] < R[j++] while ik n. A[k++] < L[i++] while j< n2 A[k++] < R[j++]
Present an example of walking through the merge sort or the quick sort algorithm (your choice) This is an algorithm tracing activity, not a coding exercise. Do not post any code or code output. Post the following for merge sort: Start with an unordered list of at least NINE elements. List all the recursive calls that would be made to sort the list, going forward. Show which pair of sub-lists will be merged each time, going back. Show the ordering of the sub-list after each recursive call returns. Post the following for quick sort: Start with an unordered list of at least NINE elements. State what element will be the pivot value (use only low index or median-of-three). List all the recursive calls that would be made to sort the list. Show the ordering of the sub-list after each recursive call returns.
• Trace BinarySearch (array, 7, 9) using both iterative and recursive binary search functions. ( See pages 29-31 on slide) array[7] ={1, 3, 5, 6, 8, 10, 11}
Suppose the following array were passed in to a mergesort algorithm: 42 39 87 21 56 93 43 35 and Draw what the array looks like after the first recursive call completes, then after the second recursive call (immediately before the final call to merge).
NEED IT IN VECTORS, NOT ARRAYS Implement InsertionSort function either iteratively or recursively: For iterative implementation: // You are required to use BinarySearch in your implementation of InsertionSort void InsertionSort (vector<int> & list) { } //Recursive Insertion Sort to sort list[first...last] recursively //You need to use BinarySearch void InsertionSort (vector<int> & list, int first, int last) { }
Write the details algorithm and convert into java code for the solution of the following problem In this assignment, you are given a following table. You implement the table as an ADT by following methods. 1- Array based implementation 2- Reference based implementation 3- Binary search tree-based implementation You implement following TABLE ADT operations a) Insert a new item into a table b) Delete the item with a given search key from a table c) Retrieve the item with a given search key from a table City Country Population Athens Greece 2,500,000 Barcelona Spain 1,800,000 Cairo Egypt 9,500,000 London England 9,400,000 New York U.S.A. 7,300,000 Paris France 2,200,000 Rome Italy 2,800,000 Toronto Canada 3,200,000 Venice Italy 300,000
Your task is sorting the given list by dictionary order, sortingoperation must be realized using the bubble sort algorithm. Additionally,this list implementation should be written using a two-dimensional char ar-ray.Bubble Sort Algorithm1 function swap ( a , b)2 // F i l l own your own !3 end function45 function compare ( a , b)6 // Compare f unc t i on should be implemented7 // to r e a l i z e the s o r t i n g c r i t e r i a .8 // For example , e l ement s in a are s t r i n g s and9 // the y are to be s o r t e d in d i c t i o n a r y order .10 // strcmp f unc t i on can be used in p l a c e11 // of compare f unc t i on .12 end function1314 function bubbl e s o r t ( a , n)15 while n != 016 high = 017 for i=0 to n=2 incremented by 118 i f compare ( a [ i ] , a [ i +1]) > 0 then19 swap ( a [ i ] , a [ i +1])20 high = i+121 end i f22 end for23 n = high24 end while25 end function1