1.) Find the pivot point. to find pivot – for a sorted (in increasing
order) and pivoted array, pivot element is the only only element for which
next element to it is smaller than it.
2.) divide the array into two subarray and apply binary search.
for calling binary search in two subarray - if
@Rahul: Please tell us what you mean by a pivoted array.
Dave
On Tuesday, August 28, 2012 12:56:03 PM UTC-5, rahul sharma wrote:
plz provide me algo for this,thnx
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on
