Question2: Recurrences(a)Consider the the pseudo-code below for the recursive algorithm Test Rec(4. s. f), which takesas input an array A, indexed between s and f.Test Rec(A, s. f)if s + 2

Assuming MergeSort is a correct implementation of the merge sort algorithm, which is a known and…

Question 2: Recurrences a) Jonsider the the pseudo-code below for the recursive algorithm Test Rec(A. s. f), which takes is input an array A, indexed between s and f. Test Rec(A, s. f) if s + 2 91 = [] 92= [¹] Test Rec(A, s, q1) MergeSort (A, q1+1,92-1) Test Rec(A, q2, f) • Does this algorithm correctly sort the input array A? • Write the recurrence for the runtime T(n) of Test Ree when run on an array of size n. Determine the runtime of the algorithm using Master Method. Show the runtime is O(n log n) using the recursion tree.

Question 2: Recurrences a) Jonsider the the pseudo-code below for the recursive algorithm Test Rec(A. s. f), which takes is input an array A, indexed between s and f. Test Rec(A, s. f) if s + 2 91 = [] 92= [¹] Test Rec(A, s, q1) MergeSort (A, q1+1,92-1) Test Rec(A, q2, f) • Does this algorithm correctly sort the input array A? • Write the recurrence for the runtime T(n) of Test Ree when run on an array of size n. Determine the runtime of the algorithm using Master Method. Show the runtime is O(n log n) using the recursion tree.

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

sequential/linear search: example ● 15.5 Finding the value x in an Array A of N elements: Begin Variables i,x: integer, Find: boolean; i=0, Find = false, read:x; //N =number of elements in the array While (i 5 6 20 x is not in the array 0123 7 8 9 15 16.5 4 Hand turning FFFF FFF 4 FFFF 5 6 7 8 9 10
Design and analyze a decrease-conquer algorithm for the following problem: o input: an array A[lo.. hi] whose elements are unique, and a positive integer k; o output: the kth smallest value in the array. (in C++)
Write a recursive function that find the minimum element in an array of integers.int findMin(int a[], int size);
Implement the algorithm in C++. Algorithm: substring (s, p, len) Initialize i = p and count =0 Use an array „dest‟ to hold the required substring Repeat steps 4 ,5 and 6 while count <len dest[count] =s[i] count = count+1 i = i +1 Insert string terminator at end of dest Exit
Code in Cpp:
Prob 4 Given a list of x objects, create a program that performs the following operation: -Get the first and last object and place them both at the start of the list. Example: QWERT becomes QTWER Find the worst case time complexity if the solution will be implemented using an array. Give both the EQUATION AND THE BIG-O NOTATION.
Algorithm A3: substring (s, ip, len)1. Initialize i = ip and count = 02. Use an array „dest‟ to hold the required substring3. Repeat steps 4 ,5 and 6 while count < len4. dest[count] = s[i]5. count = count +16. i = i + 17. Insert string terminator at end of dest8. Exit run the above algorithms in C/C++
01. ""Implementation of the Misra-Gries algorithm.Given a list of items and a value k, it returns the every item in the listthat appears at least n/k times, where n is the length of the array By default, k is set to 2, solving the majority problem. For the majority problem, this algorithm only guarantees that if there isan element that appears more than n/2 times, it will be outputed. If thereis no such element, any arbitrary element is returned by the algorithm.Therefore, we need to iterate through again at the end. But since we have filtredout the suspects, the memory complexity is significantly lower thanit would be to create counter for every element in the list. For example:Input misras_gries([1,4,4,4,5,4,4])Output {'4':5}Input misras_gries([0,0,0,1,1,1,1])Output {'1':4}Input misras_gries([0,0,0,0,1,1,1,2,2],3)Output {'0':4,'1':3}Input misras_gries([0,0,0,1,1,1]Output None. """
please do 4) and 5)
Fast please
Deletion operation is .…..............with arrays. TFFFFHE
Below is the recursive implementation of binary search from lab with one change (in red): the print statement at the top of the function which prints "BOO" There is also a main function which calls bsearchR on the sorted array data[] with 7 elements and searching for 10. QUESTION: How many BOOS will be printed by this program? // Recursive Binary Search Routine that does the "Real" Work int bsearchR(int a[], int lo, int hi, int x) { int m; printf("BO0\n"); // <<<<==== NEW STATEMENT if(hi < lo) return -1; m = (lo + hi) / 2; if(a[m] == x) return m; else if(x < a[m]) return bsearchR(a, lo, m-1, x); else return bsearchR(a, m+1, hi, x); } int main() { int data[] = {5, 8, 12, 15, 20, 25, 30}; int idx = bsearchR(data, e, 6, 10); return 0; }