how to search an element in sorted linked list with time
complexity is O(log n).
- 3 Answers
- 14131 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 |
How do you make a bubble chart with 3 variables?
How many sorting techniques are there?
What is reduction to sorting method?
How do you find the second largest element in an array of integers?
Differentiate linear from non linear data structure?
What is meant by linked list?
Is it possible to increase size of array?
What's the difference between an array and vector?
Why is quicksort so fast?
How can we delete the first node from the singly linked list?
What are the four types of variables?
Explain binary tree traversals?
Windows 
