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
- 13880 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 the complexity of adding an element to the heap?
Why using cookie to store session info is a better idea than just using session info in the request?
What is an recursive algorithm?
Is hashmap keyset ordered?
How is the front of the queue calculated ?
Explain the sorting algorithm that is most suitable to be used with single linked list?
Name few collections map implementations?
What are the scenarios in which an element can be inserted into the circular queue?
Briefly explain recursive algorithm?
What is harvesting in agriculture?
what are the applications of Linked Lists?
Is list same as array?
Which is faster hashmap or hashset?
How do you sort in ascending order in arraylist?
Which language is best for data structures?
