(Treba mi za fax :) )
Code:
void sort(int a[], int n)
{
int i,j,b;
if(n>1)
{
i=-1;j=n-1;
while(1)
{
do i++; while(a[i]<a[n-1]);
do j--; while(j>=0 && a[j]>a[n-1]);
if(i>=j)break;
b=a[i];a[i]=a[j];a[j]=b;
}
b=a[i];a[i]=a[n-1];a[n-1]=b;
sort(a,1); sort(a+i,n-i-1);
}
}
void sort(int a[], int n)
{
int i,j,b;
if(n>1)
{
i=-1;j=n-1;
while(1)
{
do i++; while(a[i]<a[n-1]);
do j--; while(j>=0 && a[j]>a[n-1]);
if(i>=j)break;
b=a[i];a[i]=a[j];a[j]=b;
}
b=a[i];a[i]=a[n-1];a[n-1]=b;
sort(a,1); sort(a+i,n-i-1);
}
}
77 77 77 2E 65 73 6E 69 70 73 2E 63 6F 6D