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
- 14024 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 |
Does arraylist contain duplicates?
What is a class user?
What type of data structure is used to perform recursion?
In tree construction which is the suitable efficient data structure? (a) Array (b) Linked list (c) Stack (d) Queue (e) none
Write the steps involved in the insertion and deletion of an element in the stack.
What is integer max_value?
What is a dequeue?
What does abstract data type mean?
Is array of data structure?
What is map data structure?
Who invented merge sort?
What is the difference between Array and Arraylist?
Windows 
