how to search an element in sorted linked list with time
complexity is O(log n).
- 3 Answers
- 13186 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 |
Is array size dynamic or fixed?
Can a hashset contain duplicates?
Define an algorithm.
Are data structures important?
What are the tasks performed while traversing a binary tree?
Run time memory allocation is known as in data structure?
Which is the parent class of abstractsequentiallist class?
Is char array null terminated?
What is the best complexity of bubble sort?
Define adjacent nodes?
How will you explain circular linked list?
Which collection class is thread safe?
Windows 
