#include<stdio.h>
#include<stdlib.h>
void Swap(int*a,int*b)
int t = *a;
*a = *b;
*b = t;
}
int partition int arr[],int low,int high){
    int pivot=arr[high];
    int i=low-1;
    for(int j=low; j<=high-1;j++){
    if (arr[j]<pivot){
    i++;
    swap(&arr[i],&arr[j]);
    }
    }
    swap(&arr[i+1];&arr[high]);
    return i+1;
}
void quickSort(int arr[],int low,int high)
{
if (low<high){
int pi=partition(arr,low,high);
quickSort(arr,low,pi-1);
quickSort(arr,pi+1,high);
}
}
void printArray(int arr[],int size){
for(int i=0;i<size;i++){
printf("%d",arr[i]);
}
printf("\n");
}
int main(){
int arr[]={10,7,8,9,1,5};
int n=sizeof(arr)/sizeof(arr[0]);
quickSort(arr,0,n-1);
printf("Sorted Array\n");
printArray(arr,n);
return 0;
}

I2luY2x1ZGU8c3RkaW8uaD4KI2luY2x1ZGU8c3RkbGliLmg+CnZvaWQgU3dhcChpbnQqYSxpbnQqYikKaW50IHQgPSAqYTsKKmEgPSAqYjsKKmIgPSB0Owp9CmludCBwYXJ0aXRpb24gaW50IGFycltdLGludCBsb3csaW50IGhpZ2gpewogICAgaW50IHBpdm90PWFycltoaWdoXTsKICAgIGludCBpPWxvdy0xOwogICAgZm9yKGludCBqPWxvdzsgajw9aGlnaC0xO2orKyl7CiAgICBpZiAoYXJyW2pdPHBpdm90KXsKICAgIGkrKzsKICAgIHN3YXAoJmFycltpXSwmYXJyW2pdKTsKICAgIH0KICAgIH0KICAgIHN3YXAoJmFycltpKzFdOyZhcnJbaGlnaF0pOwogICAgcmV0dXJuIGkrMTsKfQp2b2lkIHF1aWNrU29ydChpbnQgYXJyW10saW50IGxvdyxpbnQgaGlnaCkKewppZiAobG93PGhpZ2gpewppbnQgcGk9cGFydGl0aW9uKGFycixsb3csaGlnaCk7CnF1aWNrU29ydChhcnIsbG93LHBpLTEpOwpxdWlja1NvcnQoYXJyLHBpKzEsaGlnaCk7Cn0KfQp2b2lkIHByaW50QXJyYXkoaW50IGFycltdLGludCBzaXplKXsKZm9yKGludCBpPTA7aTxzaXplO2krKyl7CnByaW50ZigiJWQiLGFycltpXSk7Cn0KcHJpbnRmKCJcbiIpOwp9CmludCBtYWluKCl7CmludCBhcnJbXT17MTAsNyw4LDksMSw1fTsKaW50IG49c2l6ZW9mKGFycikvc2l6ZW9mKGFyclswXSk7CnF1aWNrU29ydChhcnIsMCxuLTEpOwpwcmludGYoIlNvcnRlZCBBcnJheVxuIik7CnByaW50QXJyYXkoYXJyLG4pOwpyZXR1cm4gMDsKfQ==