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
- 13861 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 the difference between binary tree and binary search tree?
For the following COBOL code, draw the Binary tree? 01 STUDENT_REC. 02 NAME. 03 FIRST_NAME PIC X(10). 03 LAST_NAME PIC X(10). 02 YEAR_OF_STUDY. 03 FIRST_SEM PIC XX. 03 SECOND_SEM PIC XX.
What is default size of hashmap?
What are the different types of sorting in data structure?
What is data structure? Explain.
Classify the Hashing Functions based on the various methods by which the key value is found.
How many parts are there in a declaration statement using data structures?
What do you mean by level of the tree?
How does a dynamic array work?
What is raid (redundant array of inexpensive disks)? Explain its level?
What are doubly linked lists?
What is quick sort example?
Windows 
