how to search an element in sorted linked list with time
complexity is O(log n).
- 3 Answers
- 12567 Views
- Wipro, I also Faced
- E-Mail Answers
Answer Posted / pritam
we can use the binary search algorithm for this problem because this searching algorithm has O(log n) performance in both worse and average case.
| Is This Answer Correct ? | 3 Yes | 7 No |
Post New Answer View All Answers
What are arrays used for?
Why is hashmap used?
What is data structure and its types?
Explain the term tail recursion?
What are the advantages of modularity?
What are the scenarios in which an element can be inserted into the circular queue?
What is the difference between collections class vs collections interface?
What is the default size of arraylist?
What is a hash in programming?
What are the pre-requisite for the collection to perform binary search?
Compare Queue and Topic ?
Describe tree rotation in avl tree.
Why is hashmap faster?
What is non linear structure?
what are the applications of Linked Lists?
