#include<iostream> using namespace std; #include<string> #include<ctime> int main() { //冒泡排序法 int arr[10] = { 3,5,6,4,2,9,8,1,7,0 }; cout << "排序前的数组为:" << endl; for (int i = 0; i < 10; i++) { cout << arr[i] << "\t"; } cout << endl; for (int j = 0; j <= 9; j++) { for (int i = 0; i < 9-j; i++) { int max = arr[i]; if (arr[i] > arr[i + 1]) { arr[i] = arr[i + 1]; arr[i + 1] = max; } } cout << "第" << j + 1 << "轮排序后的数组为:" << endl; for (int n = 0; n < 10; n++) { cout << arr[n] << "\t"; } cout << endl; } cout << "排序后的数组为:" << endl; for (int i = 0; i < 10; i++) { cout << arr[i] << "\t"; } cout << endl; system("pause"); return 0; }
原文链接: https://www.cnblogs.com/hackerteen/p/12386038.html
欢迎关注
微信关注下方公众号,第一时间获取干货硬货;公众号内回复【pdf】免费获取数百本计算机经典书籍;
也有高质量的技术群,里面有嵌入式、搜广推等BAT大佬
原创文章受到原创版权保护。转载请注明出处:https://www.ccppcoding.com/archives/332584
非原创文章文中已经注明原地址,如有侵权,联系删除
关注公众号【高性能架构探索】,第一时间获取最新文章
转载文章受原作者版权保护。转载请注明原作者出处!