The worst case time required to search a given element in a sorted linked list of length n is
| A. | O(1) |
| B. | O(log2 n) |
| C. | O(n) |
| D. | O(n log2 n) |
Answer : C Explanation : |
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
