The binary search algorithm is the optimal ____ case algorithm for solving searc

Question

The binary search algorithm is the optimal ____ case algorithm for solving search problems by the comparison method.
   a. best
   b. average
   c. worst
   d. second best

In open addressing, data is stored in which of the following?
   a. linked list
   b. hash table
   c. stack
   d. queue

To search through a list you need to know the length of the list.
   a. true
   b. false

In the binary search algorithm, two key comparisons are made through every iteration of the loop.
   a. true
   b. false

What is usually returned if the search item is found during a search of a list?
   a. the location of the element
   b. the element
   c. -1
   d. true

Explanation / Answer

answer:

1)  The binary search algorithm is the optimal worst case algorithm for solving search problems by the comparison method

2) Hash table

3): true

4) False

5): the location of the element

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.