冒泡排序
#include <iostream>
#include <cstdio>
using namespace std;
void DataSwap(int* data1, int* data2){
int temp = *data1;
*data1 = *data2;
*data2 = temp;
}
void BubbleSort(int* pDataArray, int n){
bool flag = false;
for (int i = 0; i < n - 1; i++) {
flag = false;
for (int j = 0; j < n - i - 1; j++)
if (pDataArray[j] > pDataArray[j + 1]) {
flag = true;
DataSwap(&pDataArray[j], &pDataArray[j + 1]);
}
if (false != true) {
break;
}
}
}
int main(){
int arr[10] = {1,2,4,2,3,5,6,1,4,12};
BubbleSort(arr, 10);
for (int i = 0; i < 10; ++i){
printf("%d ", arr[i]);
}
return 0;
}