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)); O a. XXXX: lo+1, YYYY: hi O b. XXXX: mid, YYYY: mid O .XX: lo, YYYY: hi O d. XXXX: lo+1, YYYY: hi-1 O e. XXXX: mid+1. YYYY: mid-1

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)); O a. XXXX: lo+1, YYYY: hi O b. XXXX: mid, YYYY: mid O .XX: lo, YYYY: hi O d. XXXX: lo+1, YYYY: hi-1 O e. XXXX: mid+1. YYYY: mid-1

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Q: (Weiss 7.40): The following divide-and-conquer algorithm is proposed for finding the simultaneous…

A: Given: (Weiss 7.40): The following divide-and-conquer algorithm is proposed for finding the…

Q: Suppose you have the following sorted list [3, 5, 6, 8, 11, 12, 14, 15, 17, 18] and are using the…

A: Given a sorted array : [3, 5, 6, 8, 11, 12, 14, 15, 17, 18] Size of array : 10 Subscript Range : 0-9…

Q: Write a recursive function named merge_sort that sorts a given list using the recursive algorithm of…

A: Note: - We are allowed to answer one question at a time because you did not specify which question…

Q: Problem 2: Search an Array Considering the search problem, we have a list of n integers A = (v1, v2,…

A: Given : N element will be given we have to design an algorithm to check whether an element x…

Q: Problem 2: Search an Array Considering the search problem, we have a list of n integers A = (v1, v2,…

A: Ans:) The program is given below with complete implementation: Approach: Input the array Iterate…

Q: Suppose you are given an array A of n Your task is to sort n numbers stored in array A by reading…

A: Everytime we select an element and is compared with all the other elements in array and finally its…

Q: Write the state/order of the elements of the following array after each pass of the outermost loop…

A: Insertion Sort Insertion sort is simple sorting mechanism in which final sorted array is…

Q: Java: Consider the following algorithm for searching in an unsorted array. If the size of the array…

A: This Algorithm is based on Merge sort. Pseudocode for Merge sort: We shall now see the pseudocodes…

Q: 1. Initialize i = strlen(s1) 2. Initialize j = strlen(s2) 3. Initialize count =0; / * This segment…

A: Note: since programming language is not mentioned we are providing solution in c programming. please…

Q: Q1)Suppose you are given an array A of n elements. Your task is to sort n numbers stored in array A…

A: NOTE: As per the guidelines, we can only answer one question per post until they are subparts of…

Q: Consider the following algorithm, which may be called on an array that is not necessarily sorted.…

A: T(n) = 3T(⅔n) + 1; T(0)=0, T(1)=0, T(2) = 1

Q: What does the ff. algorithm return? (Note: indentation is important) algorithm foo(f : function, a1,…

A: In the given algorithm we have the array hit keep track of which elements of the codomain B have…

Q: AssuAssume we want to analyze empirically 4 variants of the Quicksort algorithm by varying the…

A: the code for the given requirement is

Q: 4. Consider the function IndexEqual(A,i.j) that returns true if there exists an index x (i sx sj)…

A: Below i have answered:

Q: “A” array has a members and “B” array has b members which are sorted. I need an algorithm to find…

A: As you had not mentioned the language in which I need to write a code. So I am writing the code in…

Q: Section A: Multiple Choice Questions : Q1: Consider searching element 45 using binary search in an…