冒泡排序原理简单,从最后的元素与前面的元素比较,小于则交换,最后最小的在最左边
伪代码实现如下:
for i ← 1 to length[A] //实际数组的下标从0开始
do for j ← length[A] downto i + 1
do if A[j] < A[j - 1]
then exchange A[j] ↔ A[j - 1]
实际代码实现如下,加入泛型,
template <class T> void ExchangeT(T &a, T &b)
{
T tmp = a;
a = b;
b = tmp;
}
template<class T> void BubbleSort(T a[], int n)
{
for(int i= 0; i<= n-1; i++)
{
for(int j = n-1; j>= i+1; j--)
{
if(a[j] < a[j-1])
ExchangeT(a[j], a[j-1]);
}
}
}
int main(int argc, char* argv[])
{
char szBuf[5] = {6,8,5,7,4};
BubbleSort(szBuf, 5);
}
改进版本伪代码:
for i ← 1 to length[A]
bChange = false
do for j ← length[A] downto i + 1
do if A[j] < A[j - 1]
then exchange A[j] ↔ A[j - 1]
bChange = true
if bChange is false
break forloop