Join WhatsApp ChannelDaily MCQs & Exam Updates
Computer Science Hard PPSC Uploaded: 13 Aug 2026

What is the time complexity of binary search?

  • A O(n)
  • B O(n^2)
  • C O(log n)
  • D O(1)
Correct Answer: Option C — O(log n)
Explanation:
Binary search has a time complexity of O(log n) because it repeatedly divides the search interval in half, quickly narrowing down the target...
Submitted by: PaperMCQs
Related MCQs