编程练习6

循环数组

//数组中的数按步长向右移动，补充到数组头部，简称循环数组
#include <iostream>
using namespace std;

void print(int* dig,int n)
{
    for(int i=0;i<n;++i)
        cout<<dig[i]<<" ";
    cout<<endl;
}
void move(int* dig,int n,int step)
{
    if (step>=n) return;
    int* tmp=(int*)malloc(step*sizeof(int));
    int i;

    for(i=0;i<step;++i)
        tmp[i]=dig[n-step+i];
    for(i=n-1;i>=step;--i)
        dig[i]=dig[i-step];
    for(i=0;i<step;++i)
        dig[i]=tmp[i];

}
int main()
{
    int dig[]={2,3,6,9,1,43,32,34};
    int n=sizeof(dig)/sizeof(int);
    int step=2;
    print(dig,n);
    for(int i=0;i<10;++i)
    {
        move(dig,n,step);
        print(dig,n);
    }

    return 0;
}