Interested to Buy Any Domain ? << Click Here >> for more details...
what is a complexity of linear search,binery search?
- 10 Answers
- 40400 Views
- ABB, Google, I also Faced
- E-Mail Answers
Answer Posted / saurabh teotia
the complexity of linear search is o(n) n that of binary search is o(logn)
| Is This Answer Correct ? | 66 Yes | 5 No |
Post New Answer View All Answers
Is pointer a variable in data structure?
Explain what are the major data structures used in the hierarchical data model?
What are the difference between arraylist and linkedlist from the perspective of sorting?
Explain extended binary tree.
What is map entry?
Discuss the difference between a stack and an Array?
How to traverse data in a linked list in forward and backward direction, write the algorithm?
Do all declaration statements result in a fixed reservation in memory?
Can arraylist hold duplicates?
Can we make hashmap synchronized?
What are the collision resolution methods?
What are different types of sorting algorithms?
What are stacks? Give some of its applications.
Which type of memory allocation is referred for linked list?
What is data type in data structure?
