how to search an element in sorted linked list with time
complexity is O(log n).
- 3 Answers
- 12526 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 quick sort?
Describe the height term in a tree.
How to initialize Dictionary using collection initialize?
Which interfaces are implemented by abstractsequentiallist?
An array having 100 elements have numbers from 1 to 99 randomly out of which any number is repeated. Find the repeated number in minimum time and space complexity.
how to insert a new node in linked list where free node will be available?
Define splay tree?
What are the different types of data structures?
Define heap order property?
Write an algorithm to show various operations on ordered list and arrays
Define a complete binary tree?
List the area of applications of data structure.
Windows 
