Data Structure › Time Complexity › Question #15242
Single Choice Easy

QWhat is the time complexity of searching for an element in a sorted array using binary search?

ID: #15242 Time Complexity 156 views
Question Info
#15242Q ID
EasyDifficulty
Time ComplexityTopic
Start Quiz on This Topic
 Your Answer

Choose the Best Option

Click any option to instantly check if you're correct.

  • A O(log n) ✔ ✖
  • B O(n) ✔ ✖
  • C O(n log n) ✔ ✖
  • D O(1) ✔ ✖
Correct Answer

Explanation

Binary search is an efficient search algorithm that operates on sorted arrays by repeatedly dividing the search interval in half. In each iteration, it compares the middle element with the target element and adjusts the search range accordingly. This process continues until the target element is found or the search range becomes empty. Since each comparison reduces the search space by half, the time complexity of binary search is logarithmic with respect to the number of elements in the array, denoted as O(log n).

 Continue Practice
No Previous Next Question
 Share

Share This Question

Challenge a friend or share with your study group.

 More from This Topic

Related MCQ Questions

What is the time complexity of a depth-first search (DFS) algorithm on a directed acyclic graph (DAG) with V v What is the time complexity of a merge sort algorithm for sorting an array of n elements in the worst case? What is the time complexity of a selection sort algorithm for sorting an array of n elements in the worst case What is the time complexity of a delete operation in a binary heap in the worst case? What is the time complexity of a selection sort algorithm for sorting an array of n elements in the worst case What is the time complexity of a bubble sort algorithm for sorting an array of n elements in the worst case? What is the time complexity of a binary search algorithm for finding an element in a sorted array of n element What is the time complexity of a linear search algorithm for an unsorted array of n elements in the worst case What is the time complexity of a topological sort algorithm on a directed acyclic graph (DAG) with V vertices What is the time complexity of a depth-first search (DFS) algorithm on a graph with V vertices and E edges?