实验四

蔚落 2021-11-09 08:48 370阅读 0赞

Part1

#include <stdio.h>
    const int N=5;
    int main()
    {
        int a[N] = {
        1, 2, 3, 4, 5};
        int i;
        for(i=0; i<N; i++)
        printf("%d: %d\n", &a[i], a[i]);
        return 0;
    }

![1616761-20190425224108034-1086839334.png][]

#include <stdio.h>
    const int N=5;
    int main()
    {
        char a[5] = {
        'h','e','l','l','o'};
        int i;
        for(i=0; i<N; i++)
        printf("%d: %c\n", &a[i], a[i]);
        return 0;
    }

![1616761-20190425224302114-1259622451.png][]

#include <stdio.h>
    const int N=5;
    int main()
    {
        double a[5] = {
        1.0, 2.0, 3.0, 4.0, 5.0};
        int i;
        for(i=0; i<N; i++)
        printf("%d: %.2f\n", &a[i], a[i]);
        return 0;
    }

![1616761-20190425224445583-110042686.png][]

Part2

#include <stdio.h>
    int main()
    { 
        int a[5];
        a[0] = 1;
        a[1] = 9;
        a[2] = 8;
        a[3] = 6;
        a[4] = 0;
        printf("a[0] = %d\n", a[0]);
        printf("a[1] = %d\n", a[1]);
        printf("a[2] = %d\n", a[2]);
        printf("a[3] = %d\n", a[3]);
        printf("a[4] = %d\n", a[4]);
        return 0;
    }

![1616761-20190425224610341-515714485.png][]

Part3

#include <stdio.h>
    const int N=5;
    int main()
    {
        int score[N] = {
        99, 82, 88, 97, 85};
        int i;
        for(i=0; i<N; i++)
        printf("%d ",score[i]);
        return 0;
    }

![1616761-20190425224857722-1130847381.png][]

#include <stdio.h>
    const int N=5;
    void print(int x);
    int main()
    {
        int score[N] = {
        99, 82, 88, 97, 85};
        int i;
        for(i=0; i<N; i++)
        print(score[i]);
        return 0;
    }
    void print(int x)
    {
        printf("%d ",x);
    }

![1616761-20190425225011759-42624203.png][]

#include <stdio.h>
    const int N=5;
    void init(int a[],int n, int value);
    int main()
    {
        int b[N],i;
        init(b,N,-1);
        for(i=0;i<N;i++)
        printf("%3d",b[i]);
        return 0;
    }
    void init(int a[], int n, int value)
    {
        int i;
        for(i=0;i<n;i++)
        a[i] = value;
    }

![1616761-20190425225133695-965466970.png][]

Part4

#include <stdio.h>
    const int N=5;
    void bubbleSort( int [], int); 
    int main() 
    {
        int i,a[N];
        printf("请输入%d个整型数据: \n", N);
        for(i=0; i<N; i++)
        scanf("%d",&a[i]);
        printf("排序前的数据: \n");
        for(i=0; i<N; i++)
        printf("%d ",a[i]);
        printf("\n");
        bubbleSort(a,N); 
        printf("排序后的数据: \n");
        for(i=0; i<N; i++)
        printf("%d ",a[i]);
        printf("\n");
        return 0;
    }
    void bubbleSort( int x[], int n)
    {
        int i,j,t;
        for (i=0; i<n-1; i++) 
        {
        for(j=0; j<n-1-i; j++) 
        {
        if( x[j] > x[j+1] ) 
        {
        t = x[j];
        x[j] = x[j+1];
        x[j+1] = t;
        }
         }
          }
    }

![1616761-20190425225355160-1505687306.png][]

Part5

#include <stdio.h>
    int findMax(int a[], int n); // 函数声明
    const int N=5;
    int main() {
        int a[N];
        int max, i;
        
        printf("输入%d个整数: \n", N);
        for(i=0;i<5;i++)
        scanf("%d",&a[i]);
        max=findMax(a,N);
        printf("数组a中最大元素值为: %d\n\n", max); 
            
        return 0;
    } 
    int findMax(int a[],int n)
    {
        int i,max;
        max=a[0];
        for(i=0;i<5;i++){
            if(a[i]>max)
            max=a[i];
                }
                return max;
     }

![1616761-20190425230446104-669145170.png][]

#include <stdio.h>
    const int N=4;
    void output(char x[], int n);
    void bubbleSort(char x[],int n); 
    int main() {
        char string[N] = {
        '2','0','1','9'};
        int i;
        printf("排序前: \n");
        output(string, N);
        bubbleSort(string,N);
        printf("\n排序后: \n"); 
        output(string, N);
        
        printf("\n");
        
        return 0;    
    } 
    void output(char x[], int n) {
        int i;
        
        for(i=0; i<N; i++)
            printf("%c", x[i]);
    } 
    void bubbleSort(char x[],int n){
        int i,j;
        char t;
        for(i=0;i<n-1;i++){
            for(j=0;j<n-1-i;j++){
                if(x[j]<x[j+1]){
                    t=x[j];
                    x[j]=x[j+1];
                    x[j+1]=t;
                }
            }
        }
    }

![1616761-20190425230626055-1921155922.png][]

![1616761-20190425230409902-755925934.png][]

![1616761-20190425224741876-147322340.png][]

![1616761-20190425224757816-786757280.png][]

![1616761-20190425224814994-1620920349.png][]

转载于:https://www.cnblogs.com/TiAmoz/p/10771773.html

[1616761-20190425224108034-1086839334.png]: /images/20211109/3d6886b5e6e24ce18070633f1881c3b7.png
[1616761-20190425224302114-1259622451.png]: /images/20211109/3088d7293b7f4fedaeb31c24b6990f1d.png
[1616761-20190425224445583-110042686.png]: /images/20211109/52919dd2b1df4984a555199acbd63ce9.png
[1616761-20190425224610341-515714485.png]: /images/20211109/029cb4f3344a415ba0bbfd8878b3de99.png
[1616761-20190425224857722-1130847381.png]: /images/20211109/f30dbc4f40d14b2fb7c7c796e27f7d8b.png
[1616761-20190425225011759-42624203.png]: /images/20211109/ade034025daf492eb0dfd6624c7d4aa9.png
[1616761-20190425225133695-965466970.png]: /images/20211109/29f1d6b83f8845e8aec23d0a003c31d3.png
[1616761-20190425225355160-1505687306.png]: /images/20211109/2fc81526ebcf4e2a9c81caf689056058.png
[1616761-20190425230446104-669145170.png]: /images/20211109/a14d94470a8d47a6b29620ab988f97a1.png
[1616761-20190425230626055-1921155922.png]: /images/20211109/a577b1a8f9274dd2b75c056e8243ae48.png
[1616761-20190425230409902-755925934.png]: /images/20211109/7d8b2013b7414be39a0fe8348587dd91.png
[1616761-20190425224741876-147322340.png]: /images/20211109/26aab062ada44efb89a7d2775d82ee52.png
[1616761-20190425224757816-786757280.png]: /images/20211109/5a95b33839024f58aca81b03157f7e7f.png
[1616761-20190425224814994-1620920349.png]: /images/20211109/610fc4ba2a1c4462be7b9bc3f50c0721.png