C编程（西安邮电大学MOOC)

 1 #include <stdio.h>
 2 #define N 100
 3 
 4 /* 头插入 */
 5 void InsertHead(int *arr, int index, int key)
 6 {    
 7     for(int j=index-1; j>=0; j--){
 8         arr[j+1]=arr[j];/*移动*/
 9     }
10     arr[0]=key;
11 }
12 int main()
13 {    
14     int n, m, arr[N] = {0};    
15     scanf("%d,%d",&n,&m);
16     
17     for(int i=0; i<n-1; ++i){
18         scanf("%d,",&arr[i]);        
19     }
20     scanf("%d",&arr[n-1]);
21     
22     while(m--)
23         InsertHead(arr,n-1,arr[n-1]);
24         
25     for(int i=0; i<n-1; ++i){
26         printf("%d,",arr[i]);
27     }
28     printf("%d",arr[n-1]);    
29     return 0;
30 }

 1 /* 算法2 整体右移动m位, 右m位全部移动到数组左边 */
 2 #include <stdio.h>
 3 #define N 100
 4 
 5 int main()
 6 {    
 7     int n, m, arr[N] = {0};    
 8     scanf("%d,%d",&n,&m);
 9     
10     for(int i=0; i<n-1; ++i){
11         scanf("%d,",&arr[i]);        
12     }
13     scanf("%d",&arr[n-1]);
14     /* 1.数组整体向右移动m位 */
15     for(int i=n-1; i>=0; --i)
16         arr[i+m] = arr[i];
17     /* 2.右m位全部移动到数组左边 */
18     for(int i=0; i<m; ++i)
19         arr[i] = arr[i+n];
20         
21     for(int i=0; i<n-1; ++i){
22         printf("%d,",arr[i]);
23     }
24     printf("%d",arr[n-1]);    
25     return 0;
26 }

 1 /* 算法3 置换圈 */
 2 #include <stdio.h>
 3 #define N 100
 4 int gcd(int n, int m)//最大公约数
 5 {
 6     while(n)
 7     {
 8         int r = m%n;
 9         m = n;
10         n = r;
11     }
12     return m;
13 }
14 int main()
15 {    
16     int n, m, arr[N] = {0};    
17     scanf("%d,%d",&n,&m);
18     
19     for(int i=0; i<n-1; ++i){
20         scanf("%d,",&arr[i]);        
21     }
22     scanf("%d",&arr[n-1]);
23     
24     int count = gcd(n,m);//圈数(最大公约数)
25     int length = n / count; //圈长度
26     for(int i=0; i<count; ++i)//循环处理count圈
27     {
28         int t = arr[i]; //圈头元素
29         int start = i;  //圈头下标
30         int end = (start-m+n)%n;//圈尾下标
31         for(int j=1; j<length; j++)//圈内移位
32         {
33             arr[start] = arr[end];
34             start  = end;
35             end = (end-m+n)%n;
36         }
37         arr[start] = t;//圈头元素就位
38     }
39     
40     for(int i=0; i<n-1; ++i){
41         printf("%d,",arr[i]);
42     }
43     printf("%d",arr[n-1]);    
44     return 0;
45 }

 1 /* 算法4 逆序 */
 2 #include <stdio.h>
 3 #define N 100
 4 /* 逆序 */
 5 void reverse(int* arr, int left, int right)
 6 {
 7     while(left<right)
 8     {
 9         int t = arr[left];
10         arr[left] = arr[right];
11         arr[right] = t;
12         left++, right--;
13     }
14 }
15 int main()
16 {
17     int n, k, arr[N] = {0};    
18     scanf("%d,%d",&n,&k);
19     /* 输入数组 */
20     for(int i=0; i<n-1; ++i){
21         scanf("%d,",&arr[i]);        
22     }
23     scanf("%d",&arr[n-1]);
24     /* 1.将数组分成两段，左段长为n-k，右段长为k
25     分别将两段逆转(即元素排列次序与原次序相反) */
26     reverse(arr,0,n-k-1);    
27     reverse(arr,n-k,n-1);
28     /* 2.再数组元素整体逆转 */
29     reverse(arr,0,n-1);
30     /* 打印 */
31     for(int i=0; i<n-1; ++i){
32         printf("%d,",arr[i]);
33     }
34     printf("%d",arr[n-1]);  
35     return 0;
36 }

 1 /* 算法5.辅助数组 */
 2 #include <stdio.h>
 3 #define N 100
 4 int main()
 5 {
 6     int n, k, arr1[N] = {0},arr2[N] = {0};    
 7     scanf("%d,%d",&n,&k);
 8     /* 输入数组 */
 9     for(int i=0; i<n-1; ++i){
10         scanf("%d,",&arr1[i]);        
11     }
12     scanf("%d",&arr1[n-1]);
13     /* 复制 */
14      for(int i=0; i<n; ++i){
15         arr2[i] = arr1[(i-k+n)%n];//左移arr1[(i+k)%n];
16     }
17     /* 打印 */
18     for(int i=0; i<n-1; ++i){
19         printf("%d,",arr2[i]);
20     }
21     printf("%d",arr2[n-1]);  
22     return 0;
23 }

 1 /* 算法6.循环队列理论,直接输出 */
 2 #include <stdio.h>
 3 #define N 100
 4 int main()
 5 {
 6     int i, n, k, arr[N] = {0};    
 7     scanf("%d,%d",&n,&k);
 8     /* 输入数组 */
 9     for(int i=0; i<n-1; ++i){
10         scanf("%d,",&arr[i]);        
11     }
12     scanf("%d",&arr[n-1]);
13     
14     /* 打印 */
15     for(i=0; i<n-1; ++i){
16         printf("%d,",arr[(i-k+n)%n]);
17     }
18     printf("%d",arr[(i-k+n)%n]);  
19     return 0;
20 }