|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
|
//---------------------------------------------------------------------------
#pragma hdrstop
//---------------------------------------------------------------------------
#pragma argsused
#include <iostream>
#include <stdio.h>
using
namespace
std;
int
data[]={2,8,7,6,9,1,5,0};
int
main(
int
argc,
char
* argv[])
{
int
length =
sizeof
(data)/
sizeof
(
int
);
int
i=0;
while
(i < length-1)
{
int
j =0;
while
(j < length-1-i)
//每一轮找出最大值，从数组尾部往前放
{
if
(data[j] > data[j+1])
{
int
temp = data[j];
data[j] = data[j+1];
data[j+1]= temp;
}
++j;
}
++i;
}
for
(
int
i=0;i<length;i++)
{
cout << data[i] << endl;
}
getchar
();
return
0;
}
//---------------------------------------------------------------------------
|
本文转自Chinayu201451CTO博客，原文链接：http://blog.51cto.com/9233403/1967260
，如需转载请自行联系原作者
