来自C++1个回答
C最值交换排序
最赞的回答
#include<iostream>using namespace std;int foundmax(int num[]){ int max = num[0]; for (int i = 0;i < 5;i++) { if (num[i] > max) max = num[i]; } int i; for (i = 0;i < 5;i++) { if (max == num[i]) break; } return i;}void swap(int &a, int &b){ int temp = 0; temp = a; a = b; b = temp;}int foundmin(int num[]){ int min = num[0]; for (int i = 0;i < 5;i++) { if (num[i] < min) min = num[i]; } int i; for (i = 0;i < 5;i++) { if (min == num[i]) break; } return i;}int main(void){ cout << "Please input one number" << endl; int num1[1]; cin >> num1[0]; cout << "Please input five number" << endl; int num2[5]; for (int i = 0;i < 5;i++) { cin >> num2[i]; } int i = foundmin(num2); swap(num2[i], num2[0]); int j = foundmax(num2); swap(num2[j], num2[4]); for (int i = 0;i < 5;i++) { cout << num2[i]<<" "; } return 0;}