ZuoTi.Pro
Question

Which of the following is the main requirement for a binary search algorithm? a. The list must have an odd number of elements

engineering   Computer-Science   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Answer #1

Answer: b. The list must be sorted in ascending order

Explanation:

a. Incorrect
Binary search first always compares the target value with the middle value
If there are odd number of elements then it takes n/2 th value
if there are even number of elements then it takes the n+1/2 th or n -1 /2 th value
So this option is incorrect

b.Correct
Binary search algorithm always assumes that the value on the left side of middle value are always less And the right side one's are always greater
i.e the list should follow an ascending order

c Incorrect
As given explanation to b.the values on the right side of the mid point should have greater value and the left sided should have least values.
If the list is in descending order this cannot be true. SO this option is incorrect

d. Incorrect
As given explanation to a. if even number of elements are present it takes the n+1/2 th or n-1/2 th value
If odd it takes the n/2 th value. So it does not depend upon the number of elements in list

0 0
Add a comment
Know the answer?
Add Answer to:
Which of the following is the main requirement for a binary search algorithm? a. The list...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions

  • 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...

  • Write a C function that implements the Liner Search algorithm instead of Binary Search. However, this...

    Write a C function that implements the Liner Search algorithm instead of Binary Search. However, this linear search algorithm returns the indices of the longest sorted subset of numbers in an array of integers of size n. The longest sorted subset of numbers must satisfy three conditions. First, the subset consists of unique numbers (no duplicate); second, all the numbers in this subset is divisible by m, the minimum size of the subset is two elements. In the main method...

  • Course: CIS-5, Intro to Programming 1. Which algorithm is also called the sequential search? binary search...

    Course: CIS-5, Intro to Programming 1. Which algorithm is also called the sequential search? binary search linear search bubble sort selective sort 2 Which search algorithm requires that the elements be pre-sorted? linear search bubble sort binary search We were unable to transcribe this image

  • Assume the following list of 8 integers are held in an array in the order shown...

    Assume the following list of 8 integers are held in an array in the order shown : 3, 7, 18, 22, 78, 96, -4, 6 Which of the following is TRUE? A. You cannot use a binary search for these items. B. These elements are sorted in descending order. C. You cannot use a linear search with these items. D. It really doesn't make sense to sort such a small number of items E. None of the above is true.

  • C++ Sorting and Searching 1. Mark the following statements as true or false. a. A sequential...

    C++ Sorting and Searching 1. Mark the following statements as true or false. a. A sequential search of a list assumes that the list elements are sorted in ascending order. b. A binary search of a list assumes that the list is sorted. 2. Consider the following list: 63 45 32 98 46 57 28 100 Using a sequential search, how many comparisons are required to determine whether the following items are in the list or not? (Recall that comparisons...

  • 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;                                ...

  • Design a recursive algorithm that determines whether the number of leaf nodes of a Binary Search...

    Design a recursive algorithm that determines whether the number of leaf nodes of a Binary Search Tree (BST) is even or odd. An empty tree has an even number of leaves. A tree consisting of just a root has an odd number of leaves. Your function should return true for an even number of leaves, and false for an odd number of leaves. Analyze the execution time of your algorithm. Giving only the execution time without explanation will not be...

  • Design a recursive algorithm that determines whether the number of leaf nodes of a Binary Search...

    Design a recursive algorithm that determines whether the number of leaf nodes of a Binary Search Tree (BST) is even or odd. An empty tree has an even number of leaves. A tree consisting of just a root has an odd number of leaves. Your function should return true for an even number of leaves, and false for an odd number of leaves. Analyze the execution time of your algorithm. Giving only the execution time without explanation will not be...

  • Which of the following statements about sequential search is true? a. The list must be a...

    Which of the following statements about sequential search is true? a. The list must be a sorted list. b. It works only on a list of integers. c. When the search target is not in the list, every element must be tested d. The search typically starts at the middle of the list and searches on either side of the middle. e. None of the above. Consider searching for a target value of 44 in the sorted list given below...

  • 1. What is the worst case time complexity of insertion into a binary search tree with...

    1. What is the worst case time complexity of insertion into a binary search tree with n elements? You should use the most accurate asymptotic notation for your answer. 2. A binary search tree is given in the following. Draw the resulting binary search tree (to the right of the given tree) after deleting the node with key value 8. 10 3. You have a sorted array B with n elements, where n is very large. Array C is obtained...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT