Solution :-
void main(){int a[9]= {9,7,6,5,3,23,14,2,4} ;int n = 3;int c[3];int
i;int k =0;for ( i=0;i<3;i++)
c[i]= a[i];for(i=3;i<9;i++)
a[i-3] =a[i];for(i=9-3;i<9;i++)
a[i] = c[k++];for(i=0;i<9;i++)printf
<http://www.opengroup.org/onlinepubs/009695399/functions/printf.html>("\n%d",a[i]);}
On Sat, Sep 10, 2011 at 2:09 PM, kumar raja <[email protected]>wrote:
> Given an array of 'n' values you need to circular shift it 'k' times
> towards left.
>
> Input : 9 7 6 5 3 23 14 2 4
> output : 5 3 23 14 2 4 9 7 6
>
> n=9 , k= 3
>
> constraints : Time complexity O(n)
> Space complexity O(1)
>
> The solutions with O(kn) time complexity and
> O(n) complexity with O(k) space complexity are already available.
>
> I want the O(n) solution with constant space..
> --
> Regards
> Kumar Raja
> M.Tech(SIT)
> IIT Kharagpur,
> [email protected]
> 7797137043.
> 09491690115.
>
> --
> 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.
>
--
Kind Regards
Ishan Aggarwal
[image: Aricent Group]
Presidency Tower-A, M.G.Road,Sector-14
Gurgaon,Haryana.122015 INDIA
Phone : +91-9654602663
[email protected] <[email protected]>
--
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.
