#include <stdio.h>
void swap(int a,int b)
{ int temp=a;
a=b;
b=temp;
}
int Partition(int arr[], int low,int high)
{ int pivot,i,j;
pivot=arr[low];
i=low+1;
j=high;
while(i<=j)
{ while(i<=j && arr[i]<=pivot)
{ i++;
}
while(j>=i && arr[j]>pivot)
{ j--;
}
if(i<j)
{ swap(arr[i],arr[j]);
i++;
j--;
}
}
swap(arr[low],arr[j]);
return j;
}
void quickSort(int arr[], int low, int high)
{ if(low<high)
{ int loc;
loc=Partition(arr,low,high);
quickSort(arr,low,loc-1);
quickSort(arr,loc+1,high);
}
}
void main()
{ int n,i,arr[50];
for(i=0;i<n;i++)
}
quickSort(arr,0,n-1);
printf("\nQuick Sorted array is\n"); for(i=0;i<n;i++)
}
}
I2luY2x1ZGUgPHN0ZGlvLmg+CnZvaWQgc3dhcChpbnQgYSxpbnQgYikKeyAgIGludCB0ZW1wPWE7CiAgICBhPWI7CiAgICBiPXRlbXA7Cn0KCmludCBQYXJ0aXRpb24oaW50IGFycltdLCBpbnQgbG93LGludCBoaWdoKQp7ICAgaW50IHBpdm90LGksajsKICAgIHBpdm90PWFycltsb3ddOwogICAgaT1sb3crMTsKICAgIGo9aGlnaDsKICAgIHdoaWxlKGk8PWopCiAgICB7ICAgd2hpbGUoaTw9aiAmJiBhcnJbaV08PXBpdm90KQogICAgICAgIHsgICBpKys7CiAgICAgICAgfQogICAgICAgIHdoaWxlKGo+PWkgJiYgYXJyW2pdPnBpdm90KQogICAgICAgIHsgICBqLS07CiAgICAgICAgfQogICAgICAgIGlmKGk8aikKICAgICAgICB7ICAgc3dhcChhcnJbaV0sYXJyW2pdKTsKICAgICAgICAgICAgaSsrOwogICAgICAgICAgICBqLS07CiAgICAgICAgfQogICAgfQogICAgc3dhcChhcnJbbG93XSxhcnJbal0pOwogICAgcmV0dXJuIGo7Cn0KCnZvaWQgcXVpY2tTb3J0KGludCBhcnJbXSwgaW50IGxvdywgaW50IGhpZ2gpCnsgICBpZihsb3c8aGlnaCkKICAgIHsgICBpbnQgbG9jOwogICAgICAgIGxvYz1QYXJ0aXRpb24oYXJyLGxvdyxoaWdoKTsKICAgICAgICBxdWlja1NvcnQoYXJyLGxvdyxsb2MtMSk7CiAgICAgICAgcXVpY2tTb3J0KGFycixsb2MrMSxoaWdoKTsKICAgIH0KfQoKdm9pZCBtYWluKCkKeyAgICBpbnQgbixpLGFycls1MF07CiAgICBwcmludGYoIkVudGVyIHNpemU6Iik7CiAgICBzY2FuZigiJWQiLCZuKTsKICAgIHByaW50ZigiXG5FbnRlciBlbGVtZW50czoiKTsKICAgIGZvcihpPTA7aTxuO2krKykKICAgIHsgICBzY2FuZigiJWQiLCZhcnJbaV0pOwogICAgfQogICAgCiAgICBxdWlja1NvcnQoYXJyLDAsbi0xKTsKICAgIHByaW50ZigiXG5RdWljayBTb3J0ZWQgYXJyYXkgaXNcbiIpOwogICAgZm9yKGk9MDtpPG47aSsrKQogICAgeyAgIHNjYW5mKCIlZCIsJmFycltpXSk7CiAgICB9Cn0=