void BubbleSort(int arr[], int n)
{
for (int i = 0; i < n - 1; i++) {
for (int j = 0; j < n - i - 1; j++) {
if (arr[j] > arr[j + 1]) {
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
}
快速排序
void quicksort(intarray[], int low, int high){
if (low >= high)
return;
int first = low;
int last = high;
int 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);
}