不太理解插入排序,可参考此人博客较为详细:https://blog.csdn.net/qq2071114140/article/details/80428472
方法一:冒泡排序
#define _CRT_SECURE_NO_WARNINGS
#include #include int main(){
int i = 0, j = 0, m = 0;
int arr[] = {0};
printf("请输入三个数: ");
for (i = 0; i < 3; i++) {
scanf("%d", &arr[i]);
}
for (i = 0; i < 2; i++) {
for (j = 0; j < 2- i; j++) {
if (arr[j] > arr[j+1]) {
m = arr[j];
arr[j+1] = arr[j];
arr[j] = m;
}
}
}
printf("该数组从大到小的排列顺序为:");
for (i = 0; i < 3; i++) {
printf("%d ", arr[i]);
}
system ("pause");
return 0;
}
#defi