Interested to Buy Any Domain ? << Click Here >> for more details...
what is a complexity of linear search,binery search?
- 10 Answers
- 40671 Views
- ABB, Google, I also Faced
- E-Mail Answers
Answer Posted / hemant belwal
linear search=n/2
binary search=iog2n,2 in the base of log.
| Is This Answer Correct ? | 36 Yes | 91 No |
Post New Answer View All Answers
Define b-tree of order m?
How to get the index of an array element?
What is the height of binary tree?
Does treemap sort on key or value?
What is meant by strongly connected in a graph?
Is vector a collection?
Why might quick sort might be better than merge sort?
Which sorting is best?
What is sorting an array?
How do you find the height of a binary tree?
What is difference between array and arraylist?
Which of the collections allows null as the key?
What is the difference between arraylist and array?
What is thread and types of thread?
What is complexity of bubble sort?
