(b) Algorithm S takes as input an array of positive integers A[0..n-1]. The algorithm is described by the following pseudocode: 1: S(A) 2: 3: 4: 5: INORDER(T) T = EMPTY_BST for i:= 0 to n-1 INSERT BST(T,A[i]) Briefly explain what algorithm S implements. Also comment on the worst and best case running times.

(b) Algorithm S takes as input an array of positive integers A[0..n-1]. The algorithm is described by the following pseudocode: 1: S(A) 2: 3: 4: 5: INORDER(T) T = EMPTY_BST for i:= 0 to n-1 INSERT BST(T,A[i]) Briefly explain what algorithm S implements. Also comment on the worst and best case running times.

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

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++)
1.Write a Θ(n) algorithm that sorts n distinct integers, ranging in size between 1 and kn inclusive, where k is a constant positive integer. (Hint: Use a knelement array.) 2.Algorithm A performs 10n 2 basic operations, and algorithm B performs 300 ln n basic operations. For what value of n does algorithm B start to show its better performance? 3. There are two algorithms called Alg1 and Alg2 for a problem of size n. Alg1 runs in n 2 microseconds and Alg2 runs in 100n log n microseconds. Alg1 can be implemented using 4 hours of programmer time and needs 2 minutes of CPU time. On the other hand, Alg2 requires 15 hours of programmer time and 6 minutes of CPU time. If programmers are paid 20 dollars per hour and CPU time costs 50 dollars per minute, how many times must a problem instance of size 500 be solved using Alg2 in order to justify its development
Q: Consider the following algorithm Algo-X that takes an array A of n numbers and explain working of this algorithm:
1. Asymptotics. Given an array A of n integers, you'd like to output a two-dimensional n x n array B in which B[i, j] = max {A[i], A[i + 1],..., A[j]} for each i < j. For i j the value of B[i, j] can be left as is. for i = 1,2, η for j = i + 1, n " Compute the maximum of the entries A[i], A[i + 1], , A[j]. Store the maximum value in B[i, j]. (a) Find a function of such that the running time of the algorithm is O(f(n)), and clearly explain why. (b) For the same function f argue that the running time of the algorithm is also (f(n)). (This establishes an asymptotically tight bound (f(n)).) (c) Design and analyze a faster algorithm for this problem. You should give an algorithm with running O(g(n)), where lim→∞ g(n)/f(n) = 0.
a) Design an efficient algorithm to find the index of the last occurrence of a given key, K, in the given array A[0 … n − 1]. You will receive points based on your algorithm’s efficiency. b)) Analyze your algorithm. Find the exact equation of the time complexity of the algorithm you design.
Design an algorithm that takes an array containing n distinct natural numbers. A number k ≤ n and calculates the sum of the k largest numbers in the array. For example, if the array is {3, 7, 5, 12, 6} and k = 3, then the algorithm should return 25 (12+7+6). You may freely use standard data structure/s and algorithms from the course in your solution
You are given an array A, which stores n non-negative integers. Design an efficient divide-and-conquer algorithm that accepts A and n as inputs and returns the index of the maximum value in the array A. (1) Basic idea and Pseudocode: (Pleas first use a few sentences of plan language to explain the basic idea of your algorithm, then provide the pseudo-code of your algorithm. Please be clear about each step of your pseudo-code, when necessary, you can add comments to explain each step) Analysis: derive a recurrence for the running time T(n) of your algorithm, and solve the recurrence to provide the asymptotic running time of your algorithm.
See the pseudo-code of the Binary Search using recursion below. Fill in the XXXX and YYYY in the code Algorithm BinarySearch (A,v,low,hi) Input: array A indexed from low to hi with items sorted from smallest to largest. We are searching for the item v Output: returns a location index of item v in array A; if v is not found, -1 is returned. if (low > hi) then return (-1); mid = (lo + hi)/2; if (A[mid] = v) then == return(mid); if (A[mid] < v) then return(BinarySearch(A, XXXX ,hi, v)); else return(BinarySearch(a, lo, YYYY, v)); О а. ХX: lo+1, YҮҮ: hi O b. XXXX: mid, YYYY: mid О с. ХXXX: lo, YYYY: hi O d. XXXX: lo+1, YYYY: hi-1 O e. XXXX: mid+1. YYYY: mid-1
Consider the problem of finding the distance between the two closest numbers in an array of n and y is computed as x - y.) numbers. (The distance between two numbers x Design a presorting-based algorithm in pseudo code for solving this problem and determine its efficiency class. Answer: // your algorithm goes here Provide the the algorithm efficiency analysis here:
An array is called a winner if it has two entries which together add up to a third entry, i.e. if A[i] + A[j] = A[k]for some i,j,k, where i≠j≠k. a)Write an algorithm (pseudocode preferred) to determine if a given array A is a winner. Your algorithm should not use any additional data structures. b)Analyze the running time of your algorithm using Big-O notation.
asap
: In searching an element in an array, linear search can be used, even though simple to implement, but not efficient, with only O(n) time complexity. Assuming the array is already in sorted order, modify the search function below, using a better algorithm, so the average time complexity for the search function is O(log n). include <iostream> using namespace std; int search(int al), int s, int v) { 1/ Modify below codes. for (int i = 0; i <s; i++) { if (a[i] = v) return i; return -1; int main() { int intArray:10] = { 5, 7, 8, 9, 10, 12, 13, 15, 20, 34); // Search for element '12' in 10-elements integer array. cout << search(intArray, 10, 12); // '5' will be printed out. // Search for element '35' in 10-elements integer array. cout << search(intArray, 10, 35); // '-1' will be printed out. // Index '-l' means that the element is not found. return 0;