0
点赞
收藏
分享

微信扫一扫

C++ 冒泡排序法小程序

文风起武 2022-05-23 阅读 79


#include <iostream>
using namespace std;
int main()
{
int temp;
int nums[] = { 15, 25, 90, 23, 9 };
int N = sizeof(nums) / sizeof(int);
for (int i = 0; i < N - 1; i++) {
for (int j = 0; j < N - i - 1; j++) {
if (nums[j] < nums[j + 1]) {
temp = nums[j];
nums[j] = nums[j + 1];
nums[j + 1] = temp;
}
}
}
cout << nums << endl;
system("pause");
return 0;
}



举报

相关推荐

0 条评论