If the first element A1 is less than or equal to the last one Am, then n
= 0;
else (A1>Am), use divide-and-conquer to find element A[i], A[i]<=Am
while A[i-1] >= A1.
On 2010-10-29 7:49, preetika tyagi wrote:
/A “rotated array” is an array of integers in ascending order, after
which for every element i, it has been moved to element (i + n) mod
sizeOfList. Write a function that takes a rotated array and, in
less-than-linear time, returns n (the amount of rotation).
/ --
You received this message because you are subscribed to the Google
Groups "Algorithm Geeks" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
You received this message because you are subscribed to the Google Groups "Algorithm
Geeks" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
