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
- 13716 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 an externalizable interface?
What are the different types of data structures?
Describe the merge sort principle and what will be its time complexity?
Which is the parent class of hashmap class?
What is top in stack?
What is the relationship between a queue and its underlying array?
What is bubble sort used for?
What is mean by sorting?
Differentiate between compilers and interpreters.
What is the difference between arrays sort and collections sort?
What is binary tree?
What is difference between for loop and foreach?
Windows 
