Suppose you have the following sorted list [3, 5, 6, 8, 11, 12, 14, 15, 17, 18] and are using the recursive binary search algorithm. Which group of numbers you will compare to in order to find the key 8.

Suppose you have the following sorted list [3, 5, 6, 8, 11, 12, 14, 15, 17, 18] and are using the recursive binary search algorithm. Which group of numbers you will compare to in order to find the key 8.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 7SA

See similar textbooks

Similar questions

Write 2 recursive functions 1. to count number of even values in an array 2. to count number of even values in a simply linked list
Python
For a recursive binary search, put the following code in the correct order by dragging each line to the correct place. 1 2 A 5 60 7 8 ⠀ :::: if (right >= left) { if (array [mid] == item) return mid; int binarySearch(int array [], int left, int right, int item) { return binarySearch(array, left, mid - 1, item); if (array [mid] > item) return binary Search(array, mid+ 1, right, item); int mid=1+ (right - left) / 2; return -1; }
Given these 8 numeric values to be sorted using the recursive Mergesort algorithm: 92 63 24 18 69 27 64 43 The list that will be passed to the first call of the Mergesort algorithm will be the entire list of values above. Show the list that will be passed to the 5th call of the Mergesort 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
can you please convert this python code into java? Python code is as shown below: # recursive function def row_puzzle_rec(row, pos, visited): # if the element at the current position is o we have reached our goal if row[pos] == o: possible = True else: # make a copy of the visited array visited = visited[:} # if the element at the current position has been already visited then it's a loop. # as then its not possible to reach the last element, set possible to False if visited[pos]: possible = False else: # set visitied for the element as True visited[pos] = True possible = False # if its possible to move left then recurse in the left direction if pos - rowlpos} > o and row_puzzle_rec(row, pos - row[pos], visited): # return immediately if the goal is reached return True # if its possible to move right then recurse in the right direction if pos + rowlpos} < len(row) and row_puzzle_rec(row, pos + row[pos], visited): # return immediately if the goal is reached. return True return possible…
Apply the merge sort on the following list and sort the list in decreasing order: 91 98 29 93 98 53 68 33 33 47 You must show how the list is divided by the recursive calls to MERGE-SORT, then merged at each stage to obtain the final sorted list.
Given a sorted array, write a program named as ProblemB.cpp that creates a Binary Search Tree.Hints:•Write a recursive function to do the followings:a) Get the Middle of the array and make it root of the BST.b) Recursively call a function to do the same for left subarray (0 .. mid-1) and right subarray (mid+1..size-1).i) Get the middle of left half and make it left child of the root created in step a.ii) Get the middle of right half and make it right child of the root created in step a.c) return root.
WRITE THE MAIN.CPP FOR THIS PROGRAM a. Write a version of the sequential search algorithm that can be used to search a sorted list. (1, 2) b. Consider the following list: 2, 20, 38, 41, 49, 56, 62, 70, 88, 95, 100, 135, 145 Using a sequential search on ordered lists, that you designed in (a), how many comparisons are required to determine whether the following items are in the list? (Recall that comparisons mean item comparisons, not index comparisons.) (1, 2) 2 57 88 70 135 Write a program to test the function you designed. Note: Have the function,seqOrdSearch, return -1 if the item is not found in the list. (return the index of the item if found).
Convert please asap.
Question in image. Please explain the algorithm with the answer Thank you.
Write the details algorithm and convert into java code for the solution of the following problem In this assignment, you are given a following table. You implement the table as an ADT by following methods. 1- Array based implementation 2- Reference based implementation 3- Binary search tree-based implementation You implement following TABLE ADT operations a) Insert a new item into a table b) Delete the item with a given search key from a table c) Retrieve the item with a given search key from a table City Country Population Athens Greece 2,500,000 Barcelona Spain 1,800,000 Cairo Egypt 9,500,000 London England 9,400,000 New York U.S.A. 7,300,000 Paris France 2,200,000 Rome Italy 2,800,000 Toronto Canada 3,200,000 Venice Italy 300,000