how to search an element in sorted linked list with time
complexity is O(log n).
- 3 Answers
- 12547 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 data and data structure?
What are scalar values?
Define linear data structures?
What are different techniques for making hash function?
Tell me why can't constant values be used to define an array's initial size
What is a list in data structure?
State the difference between stacks and linked lists?
Can we add duplicate keys in a hashmap? What will happen if we attempt to add duplicate values?
What is merge sort and how it works?
How can you represent a linked list node?
What are the different types of data type?
Tell me why might quick sort might be better than merge sort?
Windows 
