how to search an element in sorted linked list with time
complexity is O(log n).
- 3 Answers
- 12823 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 are the main differences between the linked list and linear array?
Define back edge?
How do you sort an array in decreasing order?
What are the types of collection?
Is hashmap ordered?
Does arraylist maintain insertion order?
Write the steps involved in the insertion and deletion of an element in the stack.
Which data structures are applied when dealing with a recursive function?
Which type of sorting is best?
What is thread and types of thread?
What are the disadvantages of representing a stack or queue by a linked list?
What is binary tree? Explain its uses.
Windows 
