Correct answer: (C) An array of $n$ integers in increasing order
Explanation
Binary search needs the data to be sorted, and it needs to reach the middle element in constant time. An unsorted array fails the first condition. A linked list, even a sorted one, has to be walked to reach the middle, which takes $O(n)$ time. Only a sorted array (in increasing order) allows $O(\log n)$ time in the worst case.
More Searching and sorting algorithms questions
GATE 2025 DA Q29– Suppose that insertion sort is applied to the array [1, 3, 5, 7, 9, 11, x, 15, 13] and it…
GATE 2024 DA Q40– Let F(n) denote the maximum number of comparisons made while searching for an entry in a…
GATE 2024 DA Q45– Consider the following sorting algorithms: (i) Bubble sort (ii) Insertion sort (iii)…
GATE 2026 DA Q31– Let A be a sorted array containing 1000 distinct integers. You perform a recursive binary…
GATE 2026 DA Q49– Consider the problem of sorting the given array in ascending order: P = [1, 2, 3, 5, 4]…