how to search an element in sorted linked list with time
complexity is O(log n).
- 3 Answers
- 13205 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 binary tree in discrete mathematics?
Which sorting algorithm is considered the fastest?
What is harvesting in agriculture?
How do you find the second largest element in an array of integers?
What is the best case complexity of quicksort?
What is data structure and its operations?
When is a binary search algorithm best applied?
What are the different types of sorting in data structure?
What do u mean by array?
What is Doubly link list?
To describe the Complexity of Binary search, Quicksort and various other sorting and searching techniques..
Given M x N matrix with sorted elements row wise and column wise, find elements?
What are the Differences between map and hashmap?
Define linked lists?
What is the Insertion Sort Code?.
