排序之快速排序
//https://www.bilibili.com/video/BV1at411T75o?spm_id_from=333.337.search-card.all.click
#include<iostream>
#include<cmath>
using namespace std;
void Quicksort(int array[],int L,int R)
{
if(L>=R) return ;
int left=L,right=R;
int pivot=array[left];
while(left<right)
{
while(left<right&&array[right]>=pivot)
{
right--;
}
if(left<right)
{
array[left]=array[right];
}
while(left<right&&array[left]<=pivot)
{
left++;
}
if(left<right)
{
array[right]=array[left];
}
if(left==right)
{
array[left]=pivot;
}
}
Quicksort(array,L,right-1);
Quicksort(array,right+1,R);
}
int main()
{
int array[10]={3,2,1,5,4,6,7,2,1};
Quicksort(array,0,8);
for(int i=0;i<9;i++)
{
cout<<array[i]<<" ";
}
return 0;
}