1.冒泡排序:
int A[] = { 1,2,3,4,5,7,8,9,90,543,345,678,890,123,432,543,654,765,867 };
void swap(int& a,int& b) {
int tmp;
tmp = a;
a = b;
b = tmp;
}void printArray(int *array,int length) {
for (int i = 0; i < length; i++) {
cout << array[i] << endl;
}
}void sortpaopao(int a[],int length) {
int loop;
for (loop = 0; loop < length - 1; loop++) {
for (int i = 0; i < length - loop - 1; i++) {
if (a[i]>a[i+1]) {
int tmp = a[i];
a[i] = a[i+1];
a[i + 1] = tmp;
}
}
}
}
2.选择排序(不稳定)