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
- 14031 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 |
How do you balance a tree?
Does treeset remove duplicates?
What is significance of ” * ” ?
What is a graph?
Write the stack overflow condition.
Does arraylist extend list?
How to find if linked list has loop?
How many different binary trees and binary search trees can be made from three nodes that contain the key values 1, 2 & 3?
28 Answers Accenture, Amazon, College School Exams Tests, iGate, Microsoft, TCS, Wipro,
Which interfaces are implemented by hashmap?
Differentiate null and void?
Which sorting algorithm has minimum number of swaps?
What are the advantages of sorting and filtering data?
Windows 
