GATE DA 2025 — Question 27

Programming, Data Structures and AlgorithmsSearch algorithms: linear search and binary searchMSQ1 markEasy

For which of the following inputs does binary search take time \(O(\log n)\) in the worst case?
  1. A
    An array of \(n\) integers in any order
  2. B
    A linked list of \(n\) integers in any order
  3. C
    An array of \(n\) integers in increasing order
  4. D
    A linked list of \(n\) integers in increasing order
Practise the full 2025 paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkIntroduction to Algorithms (CLRS)The standard reference behind most GATE algorithm questions.
Practise more on Search algorithms: linear search and binary searchTimed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group