how to search an element in sorted linked list with time
complexity is O(log n).
- 3 Answers
- 12541 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 |
Describe linear probing with an example.
Why do we use different types of data structures?
How is the front of the queue calculated ?
Why is hashmap faster than arraylist?
What is data structure what is need of it?
How to sequentially represent max-heap?
When should structures be passed by values or by reference?
Is arraylist better than array?
Can arraylist store objects?
Is map a data structure?
What is meant by linked list?
What is the family trees and connection by clause?
Windows 
