What is time complexity of binary search?
- 1 Answers
- 998 Views
- I also Faced
- E-Mail Answers
Answer / Kaushalender Kumar
The time complexity of binary search in a sorted array is O(log n), where n is the number of elements in the array.
| Is This Answer Correct ? | 0 Yes | 0 No |
Tell me is it better to use a pointer to navigate an array of values, or is it better to use a subscripted array name?
What is the top of a stack?
What is a data structure?
How many types of searching are there in data structure?
What do you know about traversal in linked lists?
What is numeric array?
Define shortest path?
write a program to show the insertion and deletion of an element in an array using the position
Which is faster quick sort or merge sort?
Calculate the efficiency of sequential search?
What is a tech stack?
For addition and deletion. Which one is most preferred: array list or linked list?
Windows 
