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
- 13745 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 |
Explain the term run-time stack?
Which type of efficient data structure is used in the internal storage representation in RDBMS?
What is bubble sort used for?
Is set sorted?
What is data structure definition?
Does stringutils isempty check for null?
Is unordered_map a hash table?
What sorting algorithm does arrays sort use?
How do you find the complexity of a bubble sort?
What are binary search and fibonacci search?
What is the use of space complexity and time complexity?
What is data type explain?
Windows 
