实现方法一:
#include<iostream>
using namespace std;
void bubbleSort2(int *list, int n) {
int i, j, temp;
bool exchange; //½»»»±êÖ¾
for(i = 0; i < n; i++ ) {//×î¶à½»»»n-1´Î
exchange = false;
for(j = n-1; j > i; j--) {
if(list[j] < list[j-1]) {
temp = list[j];
list[j] = list[j-1];
list[j-1] = temp;
exchange = true;
}
}
if(!exchange)
return;
}
}
int main() {
int list[10] = {3,1,5,23,6,8,3,5,9,0};
bubbleSort2(list, 10);
for(int i = 0; i < 10; i++) {
cout <<list[i] <<" ";
}
return 0;
}
实现方法二:
#include<iostream>
using namespace std;
void maopao(int *list) {
int i, j, temp;
for(i = 0; i < 10; i++) {
for(j = 0; j < 10-1; j++) {
if(list[j] > list[j+1]) {
temp = list[j];
list[j] = list[j+1];
list[j+1] = temp;
}
}
}
}
int main() {
int list[10] = {3,5,2,7,6,9,8,0,1,6};
maopao(list);
for(int i = 0; i < 10; i++) {
cout <<list[i] <<" ";
}
return 0;
}