GATE DA 2025 Set 1 — Question 27

Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.
MSQ+1 / -0EasyBinary SearchSearching & SortingProgramming, Data Structures & AlgorithmsTime ComplexityComplexity AnalysisSingly Linked ListsLinked Lists & Hashing

Programming, Data Structures & Algorithms → Complexity Analysis → Binary Search

Last updated

Question

For which of the following inputs does binary search take time O(logn)O(\log n) in the worst case?
Your answer

Select all that apply, then check your answer.

The solution stays hidden until you check.

Continue learning with Success Tracker

A step still unclear? Work through it with support

Use Success Tracker to ask about the reasoning, then try another GATE DA question to check your understanding.

AI-powered practice· Unlimited practice on eligible plans
PYQs with solutions
Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
Practice that adapts
Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
AI doubt support
Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.

Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.

This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.

More questions on Complexity Analysis