#include <iostream>
using namespace std;
int* swap(int* a,int* b)
{
int* c;
int* temp;
temp=a;
a=b;
b=temp;
return c;
}
int partition(int arr[],int low,int high)
{
int p=arr[low];
int i=low;
int j=high;
while(i<j)
{
while(arr[i]<=p && i<=high-1)
i++;
while(arr[j]>p && j>=low+1)
j--;
if(i<j)
swap(&arr[i],&arr[j]);
}
swap(&arr[low],&arr[j]);
return j;
}
void quicksort(int arr[],int low,int high)
{
if(low<high)
{
int pi=partition(arr,low,high);
quicksort(arr,0,pi-1);
quicksort(arr,pi+1,high);
}
}
int main() {
int arr[]={1,0,4,3,2};
int n=sizeof(arr)/sizeof(arr[0]);
quicksort(arr,0,n-1);
for(int i=0;i<n;i++)
cout<<arr[i]<<" ";
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwppbnQqIHN3YXAoaW50KiBhLGludCogYikKewoJaW50KiBjOwoJaW50KiB0ZW1wOwoJdGVtcD1hOwoJYT1iOwoJYj10ZW1wOwoJcmV0dXJuIGM7Cn0KaW50IHBhcnRpdGlvbihpbnQgYXJyW10saW50IGxvdyxpbnQgaGlnaCkKewoJaW50IHA9YXJyW2xvd107CglpbnQgaT1sb3c7CglpbnQgaj1oaWdoOwoJd2hpbGUoaTxqKQoJewoJCXdoaWxlKGFycltpXTw9cCAmJiBpPD1oaWdoLTEpCgkJaSsrOwoJCXdoaWxlKGFycltqXT5wICYmIGo+PWxvdysxKQoJCWotLTsKCQlpZihpPGopCgkJc3dhcCgmYXJyW2ldLCZhcnJbal0pOwoJCQoJfQoJc3dhcCgmYXJyW2xvd10sJmFycltqXSk7CglyZXR1cm4gajsKfQp2b2lkIHF1aWNrc29ydChpbnQgYXJyW10saW50IGxvdyxpbnQgaGlnaCkKewoJaWYobG93PGhpZ2gpCgl7CgkJaW50IHBpPXBhcnRpdGlvbihhcnIsbG93LGhpZ2gpOwoJCXF1aWNrc29ydChhcnIsMCxwaS0xKTsKCQlxdWlja3NvcnQoYXJyLHBpKzEsaGlnaCk7Cgl9Cn0KaW50IG1haW4oKSB7CglpbnQgYXJyW109ezEsMCw0LDMsMn07CglpbnQgbj1zaXplb2YoYXJyKS9zaXplb2YoYXJyWzBdKTsKCXF1aWNrc29ydChhcnIsMCxuLTEpOwoJZm9yKGludCBpPTA7aTxuO2krKykKCWNvdXQ8PGFycltpXTw8IiAiOwoJcmV0dXJuIDA7Cn0=