#include<stdio.h>
int partition(int a[],int x,int l,int r){
	int i=l,j=r,temp;
	while(i<j){
		while(a[i]<=a[x])
			i++;
		while(a[j]>a[x])
			j--;
		temp=a[i];
		a[i]=a[j];
		a[j]=temp;
		}
	temp=a[x];
	a[x]=a[j];
	a[j]=temp;
	return j;
	}			
void quicksort(int a[],int l,int r){
	int p;
	if(l<r){
		p=partition(a,0,l,r);
		quicksort(a,0,p);
		quicksort(a,p+1,r);
		}
	}
int main(){
	int i,a[10];
	for(i=0;i<10;i++)
		a[i]=10-i;
	quicksort(a,0,9);
	for(i=0;i<10;i++)
		printf("%d \n",a[i]);
	return 0;
	}
 

I2luY2x1ZGU8c3RkaW8uaD4KaW50IHBhcnRpdGlvbihpbnQgYVtdLGludCB4LGludCBsLGludCByKXsKCWludCBpPWwsaj1yLHRlbXA7Cgl3aGlsZShpPGopewoJCXdoaWxlKGFbaV08PWFbeF0pCgkJCWkrKzsKCQl3aGlsZShhW2pdPmFbeF0pCgkJCWotLTsKCQl0ZW1wPWFbaV07CgkJYVtpXT1hW2pdOwoJCWFbal09dGVtcDsKCQl9Cgl0ZW1wPWFbeF07CglhW3hdPWFbal07CglhW2pdPXRlbXA7CglyZXR1cm4gajsKCX0JCQkKdm9pZCBxdWlja3NvcnQoaW50IGFbXSxpbnQgbCxpbnQgcil7CglpbnQgcDsKCWlmKGw8cil7CgkJcD1wYXJ0aXRpb24oYSwwLGwscik7CgkJcXVpY2tzb3J0KGEsMCxwKTsKCQlxdWlja3NvcnQoYSxwKzEscik7CgkJfQoJfQppbnQgbWFpbigpewoJaW50IGksYVsxMF07Cglmb3IoaT0wO2k8MTA7aSsrKQoJCWFbaV09MTAtaTsKCXF1aWNrc29ydChhLDAsOSk7Cglmb3IoaT0wO2k8MTA7aSsrKQoJCXByaW50ZigiJWQgXG4iLGFbaV0pOwoJcmV0dXJuIDA7Cgl9Cgk=