QuickSort

#include<iostream>


using namespace std;

void Repeat(int* a,int Left,int Right);
int QuickSort(int* a,int Left,int Right);


void main()
{
    int a[5] = {9,1,2,8,4}; 

    Repeat(a,0,4);

    int i = 0;

    for(i=0;i<5;i++)
    {
        cout<<a[i]<<" ";
    
    
    }
    cout<<endl;



}
void Repeat(int* a,int Left,int Right)
{
    int m = 0;
    if(Left<Right)
    {
        m = QuickSort(a,Left,Right);
        
        Repeat(a,Left,m-1);

        Repeat(a,m+1,Right);
    
    }


}
int QuickSort(int* a,int Left,int Right)
{
    int Temp = a[Left];
    while(Left<Right)
    {
        while(Left<Right&&Temp<=a[Right])     
        {
            Right--;
        
        
        }
        a[Left] = a[Right];

        while(Left<Right&&Temp>=a[Left])
        {
        
            Left++;
        
        }
        a[Right] = a[Left];
        a[Left] = Temp;
    
    }

    return Left;

}