#include<iostream>
#include<vector>
#include <stdio.h>
#include<stdlib.h>
using namespace std;
void QuickSort(int arr[], int left, int right)
{
if (left >= right)
return;
int i = left;
int j = right;
int base = arr[i];
while (i < j)
{
while (arr[j] >= base && i < j)
j--;
while (arr[i] <= base && i < j)
i++;
if (i < j)
swap(arr[i], arr[j]);
}
arr[left] = arr[i];
arr[i] = base;
QuickSort(arr ,left , i - 1 );
QuickSort(arr , i + 1 , right);
}
int main()
{
int arr[] = { 0 };
for (int i = 0; i < 10; i++)
{
int x = rand()%10;
arr[i] = x;
}
cout << "Before QuickSort,arr=[ ";
for (int i = 0; i < 10; i++)
{
cout << arr[i] ;
if (i != 9)
cout << ",";
}
cout << "]" << endl;
QuickSort(arr, 0, 9);
cout << "After QuickSort,arr=[ ";
for (int i = 0; i < 10; i++)
{
cout << arr[i];
if (i != 9)
cout << ",";
}
cout << "]" << endl;
return 0;
}
快速排序代码
最新推荐文章于 2023-12-30 16:38:57 发布