Question 2: Recurrences (a) Below is the pseudo-code for two algorithms: Practice1(A,s,f) and Practice2(A,s,f), which take as nput a sorted array A, indexed from s to f. The algorithms make a call to Bsearch(A,s,f,k) which we saw in class. Determine the worst-case runtime recurrence for each algorithm: T1(n) and T2(n). Show that T;(n) is O((log n)²) and T2(n) is O(n log n). Practicel (A,s,f) if s < f ql = [(s+ f)/2] if BSearch(A,s,q1,1) = true Practice2(A,s,f) if s < f if BSearch(A,s+1,f,1) = true return true return true else else return Practice2(A, s, f-1) return Practicel(A, ql+1, f) else else return false return false

Question 2: Recurrences (a) Below is the pseudo-code for two algorithms: Practice1(A,s,f) and Practice2(A,s,f), which take as nput a sorted array A, indexed from s to f. The algorithms make a call to Bsearch(A,s,f,k) which we saw in class. Determine the worst-case runtime recurrence for each algorithm: T1(n) and T2(n). Show that T;(n) is O((log n)²) and T2(n) is O(n log n). Practicel (A,s,f) if s < f ql = [(s+ f)/2] if BSearch(A,s,q1,1) = true Practice2(A,s,f) if s < f if BSearch(A,s+1,f,1) = true return true return true else else return Practice2(A, s, f-1) return Practicel(A, ql+1, f) else else return false return false

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

Median of two arrays given two ordered arrays with the same size as input, build an algorithm that reports the median value, obtained after unifying the two arrays. IMPORTANT: you must propose an algorithm with complexity O (log (n)). Apply divide to conquer. Example: Input: 5 1 12 15 26 38 2 13 17 30 45 Output: 16
Code in Cpp:
Coding in Python, we have the function to perform this task, V col_Hdeg whichinputs the adjacency matrix A of the graph and initializes the array vert_color s tohold vertex colors. It then calculates the degree of each vertex and stores it in thearray degrees.The while loop iterates until all vertices are colored and at each iteration, thevertex v with the highest degree is colored. The array temp is used to find the currentcolors of the neighbors of vertex v and an unused smallest color is determined aftersorting this array.
Exercise 1 Given the following recursive version of selection sort:public void recursiveSelectionSort(int a[], int n, int index){if (index == n)return;int k = minIndex(a, index, n-1);if (k != index)swap(a, k, index);recursiveSelectionSort(a, n, index + 1);}minIndex is a separate function that finds the smallest value in the given array “a” from“index” to “n-1” index values.swap is a separate function that swaps elements in the given array “a” between theelements at index “k” and “index” respectively.Assuming these 2 functions work as expected, there may be an error with therecursiveSelectionSort code. Answer the following:1) Design your own set of 8 unsorted integers in an array2) Determine what the given code will produce with your array by describing what thearray looks like with each recursive instance of recursiveSelectionSort3) If the code does have an error, describe the error, where it is, and how you would fixitFor example, if you said your array was [4 2 3 1 5 6 7 8], then…
I am trying to work with some generic search algorithms in a coding homework, and I am having trouble understanding some of it. Here are my questions: 1. For this linear search algorithm below I am trying to send an array of x and y cordinate points into it and search to see if a specific x, y point is in the array, but I don't know how to send the points into the linear search function. By the way, I am using a struct point type for the array of points and the point I am looking for. (The below code is an exact example from our teacher during a lecture.) void* linearSearchG(void* key, void* arr, int size, int elemSize, int(*compare)(void* a, void* b)) { for (int i = 0; i < size; i++) { void* elementAddress = (char*)arr + i * elemSize; if (compare(elementAddress, key) == 0) return elementAddress; } return NULL; } 2. I forgot what this line of code specifically does: void* elementAddress = (char*)arr + i * elemSize; I need to code this myself, so if you could explain…
Given an array A of random integers and an integer k, find and return the kth largest element in the array. Note: Try to do this question in less than O(N * logN) time.
1.a)Given an array which is sorted in descending [large to small] order and got no repeated numbers. You are asked to apply linear search. You are asked to find a number which exists. What should be the worst time complexity and why? b) A. Given the array of numbers 50 10 90 120 -13 3 89, you are asked to apply Binary Search to find a certain number. show the simulation and what would be the best achievable time complexity?
Write a kotlin code for Take some words in the array and pass a word to inside of loop using in operator. Prove given word is " it does not exist "
Write definition of the following method in max nLog(n) time; write the name of both implemented algorithms. bool Search (int ary[], int counter, int num) Hint: first of all sort the array and then
Can someone help me with this algorithm? No coding needed
Given two arrays a and b, where both arrays consisting of n positive integers. It is allowed to swap any element from array a with any element from b. Your task is to find the maximum possible sum you can obtain in the array a if you can do no more than (i.e. at most) k moves (swaps). Input • The first line of the test case contains two integers n and k (1Sns30;0sksn) - where n is the number of elements in a and b, while k is the maximum number of moves you can do. • The second line of the test case contains n integers a1,a2,... an • The third line of the test case contains n integers b1,b2,..,bn Output Print the answer – the maximum possible sum you can obtain in the array a if you can do no more than (i.e. at most) k swaps. Examples: Ex 1: Ex 2: Ex 3: Input 55 53 40 55665 1234 5 2243 12543 10 9 10 10 9 2423 Output: 27 39 11 • In the first test case of the example, you don't need to swap anything. • In the second test case of the example, you can swap a1=1 with bi=10, a3=3 with b3=10…
Implement the insertion sort algorithm. The function prototype is:void insertion Sort(int list[ ], int size) Before implementing this function, try it out on a small array of size 5. Plan it properly on a piece of paperand then continue.It should sort the input array in ascending order.