how to search an element in sorted linked list with time
complexity is O(log n).
- 3 Answers
- 12824 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
Which algorithm is used in arrays sort?
What is an ordered map?
What is the difference between dictionary and hashtable?
What is quick sort example?
Define articulation point?
What are priority queues?
How is a hashset implemented?
Define outdegree of a graph?
Define disjoint set adt?
Describe avl tree or height balanced binary search tree.
If you are using c language to implement the heterogeneous linked list, what pointer type should be used?
Why do we use dynamic arrays?
What is precision?
What are different types of algorithms?
Tell me can the size of operator be used to tell the size of an array passed to a function?
