1. 冒泡排序实现如下:
//冒泡排序算法,比较相邻元素,每次内层循环得出一个排序
void bubbleSort(int arr[], int length)
{
for (int i = 0; i < length - 1; i++)
{
for (int j = 0; j < length - 1 - i; j++)
{
if (arr[j] > arr[j + 1])
{
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
}
2. 快速排序算法,核心思想将数据分成两列
//快速排序算法,将数据分成两列
void quickSort(int array[], int low, int high)
{
if (low > high) //递归推出条件,非常重要
return;
int first, last, key;
first = low;
last = high;
key = array[first];
while (first < last)
{
while (first < last && array[last] >= key) //>=表明升序
{
--last;
}
array[first] = array[last];
while (first < last && array[first] <= key)
{
++first;
}
array[last] = array[first];
}
array[first] = key;
quickSort(array, low, first-1);
quickSort(array, first+1, high);
}