摘要：
1.冒泡排序 Bubble sort冒泡排序：从后向前让相邻元素两两比较，从而将最小元素移到最前，这个数就是气泡。#include main(){ int a[] = {9, 8, 7, 6, 5, 4, 3, 2, 1}; int n = 9; int i, j, temp; for (i = 0; i i; j--) if (a[j] main(){ int a[] = {9, 8, 7, 6, 5, 4, 3, 2, 1}; int n = 9; int i, temp, bound, exchange; bound... 阅读全文
