Algorithms: Clrcular shlfted array It is given a sorted circularIy shifted array
ID: 3782432 • Letter: A
Question
Algorithms: Clrcular shlfted array
It is given a sorted circularIy shifted array. This is an array of sorted unique integers such that each eIement has been shifted k positions to the right with eIements wrapping around. In other words if the Iength of the array is L, the vaIue at index i in the sorted array will be at index (i+k) % L in the sorted circularIy shifted array.
Write pseudocode such that if you are given a sorted circuIarly shifted array, you wiII return the maximum eIement.
The code must run asymptotically faster than (n).
Explanation / Answer
"Maximum Element In Circularly Shifted Array" : Complexity is O(1)
/* Descending Sorted Array CSA[] Index starts from 0*/ int MaxElementDecsArray(int k ,int L , int CSA[] )
{
int index = ( 0 + k ) % L;
int Max = CSA[index] ;
return Max ;
}
/* Ascending Sorted Array CSA[] Index starts from 0*/
int MaxElementDecsArray(int k ,int L , int CSA[] )
{
int index = ( L - 1 + k ) % L;
int Max = CSA[index] ;
return Max ;
}
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.