intArrayShift(int a[],int n,int m ){
m = m % n;int i =0, c[n], count = m;for(i =0; i < n - m; i++) c[count++]= a[i];
count =0;for(i = n - m; i < n; i++) c[count++]= a[i];for(i =0; i < n; i++) a[i]= c[i];return n;}
实验8-1-7 数组循环右移 (20分)代码:int ArrayShift( int a[], int n, int m ){ m = m % n; int i = 0, c[n], count = m; for (i = 0; i < n - m; i++) c[count++] = a[i]; count = 0; for (i = n - m; i < n; i++) c[count++] = a[i]; for (i = 0; i < n; i++) a[i]