The sides of right triangle (sorting) C

 #include <stdio.h>

#include <stdlib.h>

#include <time.h>

#define mm 20

#define max1 1000

int das1[mm],das2[mm],das3[mm];

int eas1[mm],eas2[mm],eas3[mm];

int temp[mm];

void sort_T(int* tab, int s)

{

int i,j,k;

for(i=1;i<s;i++)

{

j=i;

k=tab[j];

while((j>0) && (tab[j-1]>k))

{

tab[j]=tab[j-1];

j--;

}

tab[j]=k;

}

}

int main()

{

int a,b,c;

int i,j;

srand(time(NULL));

i=0;

do

{

a=1+rand()%1000;

b=1+rand()%1000;

c=1+rand()%1000;

if((a*a)+(b*b)==(c*c))

{

das1[i]=a;

das2[i]=b;

das3[i]=c;

eas3[i]=das3[i];

++i;

}

}while(i<mm);

sort_T(eas3,mm);

for(i=0;i<mm;i++)

{

for(j=0;j<mm;j++)

{

if(eas3[i]==das3[j])

temp[i]=j;

}

}

for(i=0;i<mm;i++)

{

eas1[i]=das1[temp[i]];

eas2[i]=das2[temp[i]];

}

printf("THE SIDES OF RIGHT TRIANGLE: \n");

for(j=0;j<mm;j++)

{

printf("%d  -  %d  = %d SORTING %d  - %d = %d \n",

das1[j],das2[j],das3[j],eas1[j],eas2[j],eas3[j]);

}

return 0;

}