1.For a sorted list of 512 elements, a binary search takes at most _______ comparisons? 11...
1.For a sorted list of 512 elements, a binary search takes at most _______ comparisons?
11
9
10
100
Homework Answers
For a sorted list of 512 elements Number of comparisons a binary search takes = log2(512)+1 = 9+1 = 10
10
Add Answer to:
1.For a sorted list of 512 elements, a binary search takes at
most _______ comparisons?
11...
Language = c++ Write a program to find the number of comparisons using the binary search...
Language = c++ Write a program to find the number of comparisons using the binary search and sequential search algorithms as follows: o Suppose list is an array of 1000 elements. o Use a random number generator to fill the list. o Use the function insertOrd to initially insert all the elements in the list. o You may use the following function to fill the list: void fill(orderedArrayListType& list) { int seed = 47; int multiplier = 2743; ...
About how many comparisons would the binary search makes if the list is of length 1...
About how many comparisons would the binary search makes if the list is of length 1 million and the search item is not in the list? 500,000 comparisons 1 million comparisons 20 comparisons None of these 1 thousands comparisons D Question 18 2 pts The time complexity of the merge sort is in the worst case and in the average case (1), () Orlogan), Oorlog) Orlogo"). (1) 001), O(nlogon) (r). (1)
Discrete Mathematics Unsorted and Sorted Lists For linear search there was no requirement for the list...
Discrete Mathematics
Unsorted and Sorted Lists For linear search there was no requirement for the list to be organized in any manner. The linear search works for lists that are "unsorted." But what if the values in the list are given in ascending order? This would be a sorted list. With a sorted list, is there a more efficient way to find the target? Unsorted Lists (4 pts) Assume there is a sorting algorithm with order of growth O(n), where...
We know that binary search on a sorted array of size n takes O(log n) time....
We know that binary search on a sorted array of size n takes O(log n) time. Design a similar divide-and-conquer algorithm for searching in a sorted singly linked list of size n. Describe the steps of your algorithm in plain English. Write a recurrence equation for the runtime complexity. Solve the equation by the master theorem.
Which of the following is the main requirement for a binary search algorithm? a. The list...
Which of the following is the main requirement for a binary search algorithm? a. The list must have an odd number of elements. b. The list must be sorted in ascending order. C. The list must be sorted in descending order. d. The list must have an even number of elements.
Write a C++ function binsearch that carries out the binary search algorithm on a sorted array...
Write a C++ function binsearch that carries out the binary search algorithm on a sorted array of integers. Your function takes as parameters an array of integers (sorted in increasing order), the size of the array, and a target integer to search for. The function returns the index of the target in the array, and returns -1 if the target is not in the array. The file main1.txt on the webpage contains code that generates a specific array of integers...
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...
Implement a binary search function that takes an integer query key and determines whether it is...
Implement a binary search function that takes an integer query key and determines whether it is in a sorted array of n integers. It should return the index of the key, if found, otherwise it should return a negative number. You should implement the function both iteratively and recursively to be sure you really understand the algorithm. Just for the fun of it, you might want to verify the O(log(n)) complexity of your function by counting the number of comparisons...
Approximately how many comparisons in the worst case would need to be made on a sorted...
Approximately how many comparisons in the worst case would need to be made on a sorted list of size 290 if we used a binary searching algorithm? a. between 0 and 10 b. between 10 and 50 c. between 50 and 100 d. between 100 and 1000 e. more than 1000
How many comparisons will it take for the binary search to find the number 17 in...
How many comparisons will it take for the binary search to find the number 17 in the list of numbers 1 4 5 7 8 17 21 24 28 29 31 37 39?
About how many comparisons would the binary search makes if the list is of length 1 million and the search item is not in the list? 500,000 comparisons 1 million comparisons 20 comparisons None of these 1 thousands comparisons D Question 18 2 pts The time complexity of the merge sort is in the worst case and in the average case (1), () Orlogan), Oorlog) Orlogo"). (1) 001), O(nlogon) (r). (1)
Discrete Mathematics
Unsorted and Sorted Lists For linear search there was no requirement for the list to be organized in any manner. The linear search works for lists that are "unsorted." But what if the values in the list are given in ascending order? This would be a sorted list. With a sorted list, is there a more efficient way to find the target? Unsorted Lists (4 pts) Assume there is a sorting algorithm with order of growth O(n), where...
Which of the following is the main requirement for a binary search algorithm? a. The list must have an odd number of elements. b. The list must be sorted in ascending order. C. The list must be sorted in descending order. d. The list must have an even number of elements.
Most questions answered within 3 hours.
-
Where is the error in this code sequence?
String s1 = "Hello";
String s2 = "ello";...
asked 10 months ago -
Financial data for Joel de Paris, Inc., for last year
follow:
Joel de Paris, Inc.
Balance...
asked 10 months ago -
Consider this reaction:
Al2(SO4)3 (aq)+ BaCl3
(aq) Al2Cl6 (aq)- +
3BaSO4(s) . What is the...
asked 10 months ago -
Suppose that Savneet is considering increasing her
recent random sample from 20 car rentals to 40...
asked 10 months ago -
Trucks arrive at an unloading terminal at an average rate of 120
per hour.
Trucks arrive...
asked 10 months ago -
Why are methanol and ethanol completely soluble in water while
octanol is not very little soluble....
asked 10 months ago -
A facilities manager at a university reads in a research report
that the mean amount of...
asked 10 months ago -
When the CuSO4 is rehydrated by adding water to the anhydrous
compound, is this an endothermic...
asked 10 months ago -
A ray of sunlight is passing from diamond into crown glass; the
angle of incidence is...
asked 10 months ago -
A block of mass 0.249 kg is placed on top of a light, vertical
spring of...
asked 10 months ago -
how do the kidneys compensate in the presences of acidosis
a) trigger hyperventilate
b) reserve acid...
asked 10 months ago -
Question 501 pts
The rental rate of capital to the firm increases. Which of the
following...
asked 10 months ago