The maximum number of elements that must be examined to complete a binary search in an...

Question

Question

The maximum number of elements that must be examined to complete a binary search in an array of 234,420 elements is how many? Show your work 4.

engineering Computer-Science

Answer 1

Answer #1

So the maximum number of elements to be examined in a binary search are ceil(log₂n),

where

n =total number of elements

ceil is the ceiling function

So substituing 234420 as n in the above formula

We get ceil(log₂(234420)) = ceil(17.838736) = 18

So the maximum number of elements to be examined is 18.

Answer 2

Similar Homework Help Questions

Suppose a binary search is to be performed on a table with 50 elements. The maximum...

Suppose a binary search is to be performed on a table with 50 elements. The maximum number of elements that could be examined (probes) is: A. 4 B. 5 C. 6 D. 7
What indexes will be examined as the middle element by a binary search for the target...

What indexes will be examined as the middle element by a binary search for the target value 8 when the search is run on the following input array? Check if the input array is in sorted order. What can you say about the binary search algorithm’s result? int[] numbers = {6, 5, 8, 19, 7, 35, 22, 11, 9}; int[] numbers = {1, 2, 3, 4, 5, 6, 7, 8, 9};
What indexes will be examined as the middle element by a binary search for the target...

What indexes will be examined as the middle element by a binary search for the target value 8 when the search is run on the following input array? Check if the input array is in sorted order. What can you say about the binary search algorithm’s result? int[] numbers = {6, 5, 8, 19, 7, 35, 22, 11, 9}; int[] numbers = {1, 2, 3, 4, 5, 6, 7, 8, 9}; (Using Java code please)

What is the maximum number of comparisons made when searching a 60 element array with Binary...

What is the maximum number of comparisons made when searching a 60 element array with Binary Search? 60 30 5 6 Question 3 (3 points) What is the average number of comparisons made when searching a 60 element array with Linear Search? 06 5 A selection sort algorithm is used to sort an array containing the following values into ascending order. Give the order of the elements after each pass of the sorting algorithm. 6 4 7 2 3 5...
If the item being searched for is not in the array, binary search stops looking for...

If the item being searched for is not in the array, binary search stops looking for it and reports that it is not there when array index first > array index last. Boolean variable found equals false. Boolean variable found equals true. it finds a value larger than the search key. it has examined all the elements in the array.
Data Structures and Algorithms What is the: a. maximum number of levels that a binary search...

Data Structures and Algorithms What is the: a. maximum number of levels that a binary search tree with 100 nodes can have? b. minimum number of levels that a binary search tree with 100 nodes can have? c. maximum total number of nodes in a binary tree that has N levels? (Remember that the root is level 0.) d. maximum number of nodes in the Nth level of a binary tree? e. number of ancestors of a node in the...

JAVA question: Suppose we are performing a binary search on a sorted array called numbers initialized...

JAVA question: Suppose we are performing a binary search on a sorted array called numbers initialized as follows: // index 0 1 2 3 4 5 6 7 8 9 10 11 12 13 int[] numbers = {-30, -9, -6, -4, -2, -1, 0, 2, 4, 10, 12, 17, 22, 30}; // search for the value -5 int index = binarySearch(numbers, -5); Write the indexes of the elements that would be examined by the binary search (the mid values...
1. What is the minimum number of locations a binary search algorithm will have to examine...

1. What is the minimum number of locations a binary search algorithm will have to examine when looking for a particular value in a sorted array of 200 elements? (2 points) 1 6 7 8 200 2. In general, which of the following sorting algorithms is the MOST efficient? (2 points) Bubble sort Insertion sort Heap sort Merge sort Selection sort 3. Which of the following are quadratic-sorting algorithms? (2 points) I. insertion sort II. selection sort III. merge sort...
e Construct a binary search tree (BST) using the following array elements 60,63,15, 81,30,74,35,38,93,41,53,45,86,90). e For...

e Construct a binary search tree (BST) using the following array elements 60,63,15, 81,30,74,35,38,93,41,53,45,86,90). e For the above BST, show the use of post-order traversal to delete node 53. . For the above BST, show the path to search the node 86 and to insert a node with key

Complete the binary search function. def binary Search (array, first, last, key): if last >= first:...

Complete the binary search function. def binary Search (array, first, last, key): if last >= first: mid = int(first + (last - first)/2) if array[mid] return mid key: elif array[mid] > key: ##Statement 1 else: ##Statement 2 else: return -1 Statement 1: return binarySearch(array, last, mid+1, key) Statement 2: return binarySearch(array, mid-1, first, key) Statement 1: return binarySearch(array, first, mid+1, key) Statement 2: return binarySearch(array, mid-1, last, key) Statement 1: return binarySearch(array, mid-1, first, key) Statement 2: return binary Search(array,...