一. 冒泡排序(Bubble sorting)
冒泡排序(Bubble sorting) 的实现是通过比较数组内的相邻元素,并按大小交换位置,每次比较都要遍历全部的元素,从而依次确定最大(或最小)在一端,其具体实现过程如下图所示:
由图分析可知冒泡排序是一种稳定的排序算法,在最糟糕情况下的时间复杂度为O(n2),平均时间复杂度为O(n2)。
二. C++ 代码
#include <iostream>
using namespace std;
void BubbleSort(int arr[], int arr_size, int order)
{
for(int i = 0; i< arr_size; i++)
cout << arr[i] << " ";
cout << endl;
if(order == 1)
{
for(int i = 0; i < arr_size; ++i)
{
for(int j = 0; j < arr_size-i-1; ++j)
{
if(arr[j] > arr[j+1])
{
int tmp = arr[j];
arr[j] = arr[j+1];
arr[j+1] = tmp;
}
for(int k = 0; k < arr_size; k++)
cout << arr[k] << " ";
cout << endl;
}
}
}
else
{
for(int i = 0; i < arr_size; ++i)
{
for(int j = 0; j < arr_size-i-1; ++j)
{
if(arr[j] < arr[j+1])
{
int tmp = arr[j];
arr[j] = arr[j+1];
arr[j+1] = tmp;
}
for(int k = 0; k < arr_size; k++)
cout << arr[k] << " ";
cout << endl;
}
}
}
}
int main()
{
int arr_size, order;
int *arr;
cout << "Enter the size of an integer array: ";
cin >> arr_size;
arr = new int[arr_size];
for(int i = 0; i < arr_size; i++)
{
cout << "Enter an integer to be stored at position " << i << " : ";
cin >> arr[i];
}
cout << "Choose the sorting order:\n 1 - Ascending\n 2 - Descending\n ";
cin >> order;
BubbleSort(arr, arr_size, order);
return 0;
}