Aspire Faculty ID #17604 · Topic: JAMIA MILLIA ISLAMIA MCA 2025 · Just now
JAMIA MILLIA ISLAMIA MCA 2025

What is the time complexity of binary search in a sorted array?

Solution

Binary search repeatedly divides the search space by half. Complexity = O(log⁡n)

Previous 10 Questions — JAMIA MILLIA ISLAMIA MCA 2025

Nearest first

Next 10 Questions — JAMIA MILLIA ISLAMIA MCA 2025

Ascending by ID
Ask Your Question or Put Your Review.

loading...