LYZ的作业6

1.C

2.C

3.C

4.AC

5.1 2 3

   3 4 5

6.

#include <stdio.h>
 
int findmin(int score[], int n);
 
int main()
{
    int score[23], min, n;
    scanf("%d", &n);
    for (int i = 0; i < n; i++)
    {
        scanf("%d", &score[i]);
    }
    min = findmin(score, n);
    printf("%d\n", min);
    return 0;
}
 
int findmin(int score[], int n)
{
    int min = score[0];
    for (int i = 0; i < n; i++)
    {
        if (score[i] < min)
        {
            min = score[i];
        }
    }
    return min;
}

7.

#include <stdio.h>
#define N 10
 
void ReadScore(double score[], int n);  //用于对数组进行赋值。 
void DataSort(double score[], int n);  //用于从小到大排序数组。 
 
int main() {
	double score[N];
	int n=10, i;
	ReadScore(score, n);
	DataSort(score, n);
	return 0;
}
 
void DataSort(double score[], int n) {
	int i, j;
	double temp;
	for (i=0; i<n-1; i++) {  //x为1~10，依次比较第x位数与之后的数的大小关系。 
		for (j=i+1; j<n; j++) {
			if (score[j] < score[i]) {  //若后一位数比第x位数小，则与之互换位置。 
				temp = score[j];
				score[j] = score[i];
				score[i] = temp;
			}
		}
	}
	for (i=0; i<n; i++) {
		printf ("%lf ",score[i]);  //依次输出重新排序的数组。 
	}
}
 
void ReadScore(double score[], int n) {
	int i;
	for (i=0; i<10; i++) {
		scanf ("%lf",&score[i]);
	}
}