#include <iostream>
using namespace std;
//冒泡排序,最差时间复杂度O(n^2),
//最好时间复杂度O(n),平均时间复杂度O(n^2)
//稳定,空间复杂度O(1)
void bubbleSort(int* pData, int length) {
int temp;
for (int i = 0; i != length; ++i) {
for (int j = 0; j != length; ++j) {
if (pData[i] < pData[j])
{
temp = pData[i];
pData[i] = pData[j];
pData[j] = temp;
}
}
}
}
void printOr(int * pData, int len) {
for (int k = 0; k < len; k++) {
cout << pData[k] << ",";
}
cout << endl;
}
void printFin(int * pData, int len) {
for (int i = 0; i != len; ++i) {
cout << pData[i] << ",";
}
cout << endl;
}
int main() {
int pData[] = { 8,13,45,63,21,2,5,7,23,12,56,22,67,89 },k;
int len = sizeof(pData) / sizeof(int);
cout << "The orginal array is:" << endl;
printOr(pData, len);
bubbleSort(pData, len);
cout << "The sorted array is:" << endl;
printFin(pData, len);
cin.get();
}
运行结果: