DSA Search Quiz

What is the best case for linear search?

• O(nlogn)

• O(logn)

• O(n)

• O(1)

What is the worst case for linear search?

Where is linear searching used?

Binary Search is used in ________ Data

• Sorted
• Unsorted

• Linear

• Non Linear

Identify the number of comparisons made by the sequential search algorithm while searching for element 8 from the following list 2, 6, 19, 26, 14, 32, 15.

What search operation is followed to find the element 23 in the set [12, 23, 34, 44, 48, 53, 87, 99]

Choose the correct statement

• Only I

• Only II

• Both I and II

• None of the above statement is true

Worst case and Best case of Binary Search

• O(logn)

• O(nlogn)

Which of the following is disadvantage of Binary Search

• Need more Space

• Greater Time Complexities compared to other searching algorithms

• Not easy to understand

• Implementation is difficult

Formula for finding mid element in binary search