Question

Choose the statements that are correct.
Options:
(A) For Binary Search, all the elements have to be sorted.
(B) For Linear Search, all the elements have to be sorted.
(C) Linear Search takes less time for searching in worst case than binary search’s worst case.
(D) Linear Search always gives fast result whether elements are sorted or not.
Choose the correct answer from the options given below:

• A. (A) only
• B. (A) and (C) only
• C. (B) and (C) only
• D. (A), (B), and (D) only

Answer 1

The Correct Option is B

The correct statements are (A) and (C) only.

Additional Context:

• (A) Binary Search Requirement:
  • Mandatory sorted input array
  • Works by repeatedly dividing search interval
  • Time complexity: O(log n)
• (C) Linear Search Performance:
  • Worst-case scenario: O(n) (checks all elements)
  • Binary search worst-case: O(log n)
  • Linear is slower but works on unsorted data
• Incorrect Options Analysis:
  • (B): Linear search doesn't require sorting
  • (D): Linear search isn't always fast (depends on element position)
• Use Case Comparison:
  • Binary: Large sorted datasets
  • Linear: Small/unsorted datasets

Correct Answer: (2) (A) and (C) only.