题解 | #最大最小值#

使用冒泡排序

#include <stdio.h>
#define MaxSize 3

void sort(int nums[]) {
    for (int i = 0; i < MaxSize; i++) {
        for(int j = i + 1; j < MaxSize; j++) {
            if(nums[j] > nums[i]) {
                int n = nums[i];
                nums[i] = nums[j];
                nums[j] = n;
            }
        }
    }
}


int main() {
    int nums[MaxSize];
    for(int i = 0; i < MaxSize; i++) {
        scanf("%d", &nums[i]);
    }
    
    sort(nums);
    
    printf("The maximum number is : %d\n", nums[0]);
    printf("The minimum number is : %d\n", MaxSize > 1 ? nums[MaxSize - 1] : nums[0]);
    
    
    return 0;
}