冒泡排序

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
#include "iostream"
using namespace std;
int main() {
int length;
cout << "请输入数组长度:";
cin >> length;
int *arr = new int[length];
cout << "请输入数组元素:" << endl;
for (int i = 0; i < length; i++) {
cin >> arr[i];
}
//冒泡排序
for (int i = 0; i < length; ++i) {
for (int j = 0; j < length-i-1; ++j) {
if (arr[j]>arr[j+1])
{
int temp = arr[j];
arr[j]=arr[j+1];
arr[j+1]=temp;
}
}
}
for (int i = 0; i <length ; ++i) {
cout<<arr[i]<<" ";
}
return 0;
}