Binary Search algorithm uses the divide-and-conquer technique to find elements in O(logn)steps. Given the following sorted array that has 9 elements, what is the scope of the search(First index and last index of the array segment) in each iteration of the binary searchalgorithm while looking for the element "51"?Note: Numbers that show up in the first row are the array indexes0.1346.78.912192130323744511st Iteration -> First = 0, Last = 82nd Iteration -> First = 5, Last = 83rd Iteration -> First = 5, Last = 6%3DO 1st Iteration -> First = 0, Last = 82nd Iteration -> First = 5, Last = 8Brd Iteration -> First = 7, Last = 84th Iteration -> First = 8, Last = 8O 1st Iteration -> First = 0, Last = 82nd Iteration -> First = 0, Last = 33rd Iteration -> First = 2, Last = 34th Iteration -> First = 3, Last = 3O1st Iteration -> First = 0, Last = 82nd Iteration -> First = 0, Last 3Brd Iteration -> First = 2, Last = 3

Binary Search Pseudocode Procedure binary_search A ← sorted array n ← size of array x ←…

Binary Search algorithm uses the divide-and-conquer technique to find elements in O(logn) steps. Given the following sorted array that has 9 elements, what is the scope of the search (First index and last index of the array segment) in each iteration of the binary search algorithm while looking for the element "51"? Note: Numbers that show up in the first row are the array indexes 1 2 3. 4 6. 7 8. 9. 12 19 21 30 32 37 44 51 O 1st Iteration -> First = 0, Last = 8 %3D 2nd Iteration -> First = 5, Last = 8 3rd Iteration -> First = 5, Last = 6 %3D 1st Iteration -> First = 0, Last = 8 %3D 2nd Iteration -> First = 5, Last = 8 Brd Iteration -> First = 7, Last = 8 4th Iteration -> First = 8, Last = 8 O 1st Iteration -> First = 0, Last = 8 %3D 2nd Iteration -> First 0, Last = 3 3rd Iteration -> First = 2, Last = 3 4th Iteration First = 3, Last = 3 -> 1st Iteration -> First = 0, Last = 8 %3D 2nd Iteration -> First = 0, Last = 3 Brd Iteration -> First = 2, Last = 3

Binary Search algorithm uses the divide-and-conquer technique to find elements in O(logn) steps. Given the following sorted array that has 9 elements, what is the scope of the search (First index and last index of the array segment) in each iteration of the binary search algorithm while looking for the element "51"? Note: Numbers that show up in the first row are the array indexes 1 2 3. 4 6. 7 8. 9. 12 19 21 30 32 37 44 51 O 1st Iteration -> First = 0, Last = 8 %3D 2nd Iteration -> First = 5, Last = 8 3rd Iteration -> First = 5, Last = 6 %3D 1st Iteration -> First = 0, Last = 8 %3D 2nd Iteration -> First = 5, Last = 8 Brd Iteration -> First = 7, Last = 8 4th Iteration -> First = 8, Last = 8 O 1st Iteration -> First = 0, Last = 8 %3D 2nd Iteration -> First 0, Last = 3 3rd Iteration -> First = 2, Last = 3 4th Iteration First = 3, Last = 3 -> 1st Iteration -> First = 0, Last = 8 %3D 2nd Iteration -> First = 0, Last = 3 Brd Iteration -> First = 2, Last = 3

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

What is the time complexity for the following code/program? 1.5 A binary search works like this: in a sorted array, the search algorithm compares the target value to the middle element of the array. If they are not equal, the half in which the target cannot lie is eliminated and the search continues on the remaining half, again taking the middle element to compare to the target value and repeating this until the target value is found. If the search ends with the remaining half being empty, the target is not in the array. What is the complexity of binary search? Why?
Write pseudocode of an insertion sort algorithm. Illustrate the execution of the algorithm on the array X = {2, 11, 98, 23, 48, 33, 97, 61, 3}, writing the intermediate values of X at each iteration of the algorithm. Please and thank you
array unordered Arr has unsorted integers. SortedArr is an integer array. SortedArr performs which task better than unsortedArr? Use the fastest algorithms. Inserting a new element II Searching for a given element III Calculating the mean of the elements (A) I alone (B) II alone (C) III alone (D) I and II alone (E) I, II, and III
Suppose an array has n elements. This _____ sorts to sort and array works as follows: Find the smallest element and place it in the first position. Then find the smallest of the remaining n-1 elements and place it in the second position. Repeat on n-2 elements, n-3 elements, ..., until the array is sorted.
Suppose the binary search algorithm is used to find the value 24 in the array below. | 10 | 15 | 17 | 24 | 35 | 36 | 41 | 45 | 48 | 57 | 65 | 68 | 70 | 74 | 80 | 83 | 90 | What will be the value of the variable last when the binary search algorithm completes? a. 16 b. 8 c. 5 d. 7 e. 6
A square matrix can be represented by a two-dimensional array with N rows and N columns. You may assume a maximum size of 50 rows and 50 columns. 1. Write an algorithm MakeEmpty(n), which sets the first n rows and n columns to zero.2. Write an algorithm Add(M1, M2, M3), which adds two matrices M1 and M2 together to produce matrix M3.3. Write an algorithm Subtract(M1, M2, M3), which subtracts matrix M2 from matrix M1 to produce matrix M3.4. Write an algorithm Copy(M1, M2), which copies matrix M1 into matrix M2. Answer 1 and 2 questions with code
A square matrix can be represented by a two-dimensional array with N rows and N columns. You may assume a maximum size of 50 rows and 50 columns. 1. Write an algorithm MakeEmpty(n), which sets the first n rows and n columns to zero.2. Write an algorithm Add(M1, M2, M3), which adds two matrices M1 and M2 together to produce matrix M3.3. Write an algorithm Subtract(M1, M2, M3), which subtracts matrix M2 from matrix M1 to produce matrix M3.4. Write an algorithm Copy(M1, M2), which copies matrix M1 into matrix M2. Answer 3 and 4 Algorithms
A square matrix can be represented by a two-dimensional array with N rows and N columns. You may assume a maximum size of 50 rows and 50 columns. 1. Write an algorithm MakeEmpty(n), which sets the first n rows and n columns to zero.2. Write an algorithm Add(M1, M2, M3), which adds two matrices M1 and M2 together to produce matrix M3.3. Write an algorithm Subtract(M1, M2, M3), which subtracts matrix M2 from matrix M1 to produce matrix M3.4. Write an algorithm Copy(M1, M2), which copies matrix M1 into matrix M2.
The binary search algorithm that follows may be used to search an array when the elements are in order. This algorithm is analogous to the following approach to finding a name in a telephone book. a. Open the book in the middle and look at the middle name on the page. b. b. If the middle name isn't the one, you're looking for, decide whether it comes before or after the name you want. c. Take the appropriate half of the section of the book you were looking in and repeat these steps until you land on the name. 1. Let the bottom be the subscript of the initial array element. 2. Let the top be the subscript of the last array element. 3. Let found be false. 4. Repeat as long as the bottom isn't greater than the top and the target has not been found. 5. Let middle be the subscript of the element halfway between bottom and top. 6. If the element in the middle is the target 7. Set found to true and index to middle. else if the element in the middle is larger than the target 8. Let the top be…
Suppose an array sorted in ascending order is rotated at some pivot unknownto you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).Find the minimum element. The complexity must be O(logN)You may assume no duplicate exists in the array."""def find_min_rotate(array): """ Finds the minimum element in a sorted array that has been rotated. """ low = 0 high = len(array) - 1 while low < high: mid = (low + high) // 2 if array[mid] > array[high]: low = mid + 1 else: high = mid return array[low] def find_min_rotate_recur(array, low, high): """ Finds the minimum element in a sorted array that has been rotated. """ mid = (low + high) // 2 if mid == low:.
Let A = [5,5,5,5,5,...,5] be an array where all of the elements are equal to 5. Determine whether Selection Sort or Insertion Sort sorts this array faster.
Write the code of the insertion-sort algorithm. Illustrate the execution of the algorithm on the array A = 3, 13, 89, 34, 21, 44, 99, 56, 9, writing the intermediate values of A at each iteration of the algorithm.