冒泡排序

如下图为冒泡排序原理:

实现代码：

 1 #include 
 2 using namespace std;
 3 #include 
 4 
 5 int main()
 6 {    //冒泡排序
 7 
 8     int Arr_1[9] = { 2,4,0,5,7,1,3,8,9 };
 9     int count = _countof(Arr_1);    //数组总元素数
10     cout << "原数组元素为:" << endl;
11 
12     for (int i = 0;i < count;i++)
13     {
14         cout << Arr_1[i] << " " ;
15     }
16     cout << endl;
17     int text = 0;    //临时储存数据处
18     int num = 0;    //下标
19 
20     for (int i = 0;i < count-1;i++)    //总轮数=总元素数-1
21     {
22         for (int j = 0;j < count - i - 1;j++)    //每轮对比次数=总元素数-当前轮数-1
23         {
24             num = j;
25             if (Arr_1[num] > Arr_1[num + 1])
26             {    //相邻元素比较大小
27                 text = Arr_1[num];
28                 Arr_1[num] = Arr_1[num + 1];
29                 Arr_1[num + 1] = text;
30             }
31 
32 
33         }
34 
35 
36     }
37 
38     cout << "新数组元素为:" << endl;
39     for (int i = 0;i < count;i++)
40     {
41         cout << Arr_1[i] << " ";
42     }
43     cout << endl;
44 
45     system("pause");
46     return 0;
47 }