Interested to Buy Any Domain ? << Click Here >> for more details...
how to search an element in sorted linked list with time
complexity is O(log n).
- 3 Answers
- 13901 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 |
Which interfaces are implemented by hashmap?
State the rules to be followed during infix to prefix conversions?
Where the data structures are used?
Can arraylist contain null?
Why is hashmap used?
What is data structure and its types?
What is a sorting algorithm in data structure?
Can we store primitives in collections?
What is difference between array and string?
What are the average and worst time complexity in a sorted binary tree is
Which sorting algorithms are in place?
What is map keyset?
Windows 
