Saved Bookmarks
| 1. |
Let A be an array of integers. A Fixed point of 'A' is an integer 'i' for which A[i] = i. The time complexity of an efficient algorithm to find any fixed point in a sorted array of n is |
|
Answer» Let A be an array of integers. A Fixed point of 'A' is an integer 'i' for which A[i] = i. The time complexity of an efficient algorithm to find any fixed point in a sorted array of n is |
|