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
- 13896 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 do you mean by Syntax Error
Can you provide some implementation of a dictionary having large number of words?
Define red-black trees.
What is the best case complexity of bubble sort?
Is hashmap a collection?
How does hashset maintain order?
Define circular list?
What type of algorithm is binary search?
what is the difference between dynamic as well as non - dynamic data structures.
What is meant by binary tree traversal?
What is Another name of Dynamically allocating memory.
Which sorting algorithm is the slowest?
Windows 
