how to search an element in sorted linked list with time
complexity is O(log n).
- 3 Answers
- 12565 Views
- Wipro, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / baskerdearer
By using the skip list concept. we can search the sorted
linked list with O(log n).
| Is This Answer Correct ? | 35 Yes | 10 No |
Answer / sniper
Yes u are right ...
here are the details
http://msdn.microsoft.com/en-us/library/ms379573%28v=vs.80%29.aspx#datastructures20_4_topic4
thanks ...
| Is This Answer Correct ? | 3 Yes | 1 No |
Answer / 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 |
What is difference between an Array and ArrayList?
Parenthesis is never required in postfix or prefix expressions, why?
What is the most used data structure?
How can you implement a stack?
Can we use ordered set for performing binary search?
Can a hashset contain duplicates?
Define outdegree of a graph?
List the types of rotations available in splay tree?
Why do we need linked list?
How do you sort an array by value?
Which data structure is applied when dealing with a recursive function?
What do you understand by doubly linked list?
Windows 
