how to search an element in sorted linked list with time
complexity is O(log n).
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 dynamic data structures?
How to find 3rd element from end in a linked list in one pass?
What are the tasks performed during inorder traversal?
Differentiate linear from non linear data structure?
Explain what are the major data structures used in the network data model?
Which collection type is used to maintain uniqueness of data structure?
What is data and information explain with example?
What is a multidimensional array?
What are the different data structures?
Why sorting is done?
What is a map programming?
How do you implement a stack?
How does a selection sort work?
Which is better hashmap or arraylist?
Which is the parent class of sortedset