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
- 13855 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 do you mean by hash table?
Can we put null key in hashmap?
What method is used to place a value onto the top of a stack?
What do you understand by stable sort?
What is the difference between length () and size () of arraylist?
Define depth and height of a node?
What are basic algorithms?
What is a stable sorting algorithm?
What is the best data structure and algorithm to implement cache?
Why are b trees used?
What data structure does a binary tree degenerate?
Is arraylist faster than array?
What are common data structures?
What is the quickest sorting algorithm?
Define threaded binary tree.
