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
- 14026 Views
- Wipro, I also Faced
- E-Mail Answers
Answer Posted / 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 |
Post New Answer View All Answers
What is meant by linked list?
Can you provide some implementation of a dictionary having large number of words?
What’s the difference between enumeration and iterator interfaces?
Which sorting technique is faster?
What are threaded binary trees?
What is the minimum number of nodes that a binary tree can have?
Why do we use insertion sort?
What is two-dimensional array?
What is the complexity of adding an element to the heap?
List the differences between comparable and comparator interface?
What is Jagged Arrays?
Is duplicate allowed in hashmap?
Explain the difference between hashset and hashmap?
What is the difference between ienumerable and list?
Is vector synchronized?
