1 #include <stdio.h>
 2
 3 int mydel (int *a, int n, int k)
 4 {
 5     int i;
 6
 7     for (i = k; i < n - 1; i++)
 8         *(a+i) = *(a+i+1);
 9     n--;
10
11     return n;
12 }
13
14 void myout (int *a, int n)
15 {
16     while (n > 0)
17     {
18         printf("%4d", *a);
19         a++,n--;
20     }
21     printf("\n");
22 }
23
24 void main (void)
25 {
26     int n, k, a[10] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
27     printf("Input data: ");
28     scanf("%d", &k);
29     printf("Before delete: ");
30     myout(a, 10);
31     n = mydel(a, 10, k);
32     printf("After delete: ");
33     myout(a, n);
34 }

 1 #include <stdio.h>
 2
 3 void mysort (int *p, int n)
 4 {
 5     int i, j, k, t;
 6
 7     for (i = 0; i < n - 1; i++)
 8     {
 9         k = i;
10         for (j = k + 1; j < n; j++)
11             if (*(p+k) > *(p+j))
12                 k = j;
13         t = *(p+i);
14         *(p+i) = *(p+k);
15         *(p+k) = t;
16     }
17 }
18
19 void myout (int *p, int n)
20 {
21     while (n > 0)
22     {
23         printf("%4d", *p);
24         p++,n--;
25     }
26     printf("\n");
27 }
28
29 void main (void)
30 {
31     int a[10] = {10, 9, 8, 2, 5, 1, 7, 3, 4, 6};
32
33     printf("Before sort: ");
34     myout(a, 10);
35     mysort(a, 10);
36     printf("After sort: ");
37     myout(a, 10);
38 }

 1 #include <stdio.h>
 2
 3 void myfun (char *p);
 4
 5 void main (void)
 6 {
 7     char a[50];
 8     printf("Input data: ");
 9     gets(a);
10     myfun(a);
11     printf("After: ");
12     puts(a);
13 }
14
15 void myfun(char *p)
16 {
17     char *q = p, t;
18     while (*q != '\0')
19         q++;
20     q--;
21     while (p < q)
22     {
23         t = *p;
24         *p = *q;
25         *q = t;
26         p++;
27         q--;
28     }
29 }

 1 #include <stdio.h>
 2
 3 long int myf (int n);
 4
 5 void main (void)
 6 {
 7     int n;
 8     long int x;
 9
10     printf("Input data: ");
11     scanf("%d", &n);
12     if (n < 0)
13         printf("Wrong!\n");
14     else
15     {
16         x = myf(n);
17         printf("%d阶斐波那契级数的值为: %ld\n", n, x);
18     }
19 }
20
21 long int myf (int n)
22 {
23     long int x;
24     if (n == 1 || n == 2)
25         x = 1;
26     else
27         x = myf(n-1) + myf(n-2);
28     return x;
29 }

 1 #include <stdio.h>
 2 #include <string.h>
 3
 4 void main (void)
 5 {
 6     int i, k;
 7     char *temp, *p[4];
 8
 9     p[0] = "Zhang";
10     p[1] = "Li";
11     p[2] = "Chen";
12     p[3] = "Wang";
13     k = 0;
14     for (i = 1; i < 4; i++)
15         if (strcmp(p[i], p[k]) < 0)
16             k = i;
17     temp = p[0];
18     p[0] = p[k];
19     p[k] = temp;
20     printf("最小的字符串为: %s\n", p[0]);
21 }

 1 #include <stdio.h>
 2 #include <string.h>
 3
 4 void main (void)
 5 {
 6     int i, j;
 7     char *temp, *p[4];
 8
 9     p[0] = "Zhang";
10     p[1] = "Li";
11     p[2] = "Chen";
12     p[3] = "Wang";
13     for (i = 0; i < 3; i++)
14         for (j = 0; j < 3 - i; j++)
15             if (strcmp(p[j], p[j+1]) > 0)
16             {
17                 temp = p[j];
18                 p[j] = p[j+1];
19                 p[j+1] = temp;
20             }
21
22     printf("按从小到大排序后的字符串顺序为: \n");
23     for (i = 0; i < 4; i++)
24         printf("%s\n", p[i]);
25 }

 1 #include <stdio.h>
 2
 3 #define N 6
 4
 5 struct ex
 6 {
 7     long num;
 8     float s[N];
 9 };
10
11 void main (void)
12 {
13     struct ex wang, *p;
14     float ave, sum = 0, x;
15     int i;
16
17     p = &wang;
18     printf("Input number: ");
19     scanf("%ld", &(p->num));
20     printf("Input score: ");
21     for (i = 0; i < N; i++)
22     {
23         scanf("%f", &x);
24         p->s[i] = x;
25     }
26     printf("Number : %ld\n", p->num);
27     for (i = 0; i < N; i++)
28     {
29         sum = sum + p->s[i];
30         printf("%8.1f", p->s[i]);
31     }
32     printf("\n");
33     ave = sum / N;
34     printf("Average : %.1f\n", ave);
35 }