what is a complexity of linear search,binery search?
- 10 Answers
- 37346 Views
- ABB, Google, I also Faced
- E-Mail Answers
Answer Posted / pratik wavhal
For Linear Search Complexity Is :- O(n).
For Binary Search Complexity Is :- O(log(at base 2)n).
| Is This Answer Correct ? | 8 Yes | 4 No |
Post New Answer View All Answers
Can a binary tree be empty?
write an algorithm to show the procedure of insertion into a b-tree?
What is the time complexity of selection sort?
Does arraylist allow null values?
What is the difference between classifying and sorting?
What is the difference between one and two dimensional?
What is indexing an array?
What is bubble sort in data structure?
Is sorting a math skill?
What is the method to find the complexity of an algorithm?
Does arraylist maintain insertion order?
How do you separate zeros from non-zeros in an array?
What are the main differences between the linked list and linear array?
How do you rotate an AVL tree?
What is meant by hashing?
