retagged by
1,191 views
2 votes
2 votes

.Given an array of distinct integers A[1, 2,…n]. Find the tightest upper bound to check the existence of any index i for which A[i]=i.


Ans should be O(log n) right by doing binary search ??

retagged by

1 Answer

Related questions

1 votes
1 votes
1 answer
3
Sambhrant Maurya asked Aug 7, 2018
728 views
Suppose A is a sorted array and some of the elements are duplicates. What is the best upper bound to find out the number of elements that are equal to a given key 'k'a)...