GATE CS 2021 (Afternoon) — Question 18

AlgorithmsSearching, Sorting, Hashing MechanismsMCQ1 mark · −1/3 if wrongEasy

What is the worst-case number of arithmetic operations performed by recursive binary search on a sorted array of size \(n\)?
  1. A
    \(\Theta(\sqrt{n})\)
  2. B
    \(\Theta(\log_2 (n))\)
  3. C
    \(\Theta(n^2)\)
  4. D
    \(\Theta(n)\)
Practise the full 2021-AN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkIntroduction to Algorithms (CLRS)The standard reference behind most GATE algorithm questions.
Practise more on Searching, Sorting, Hashing MechanismsTimed, 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