#include<stdio.h>
// My implementation of sort
#define LEN ( sizeof(x) / sizeof(int) )
main()
{
int x[] = {5,3,2,7,8,9} ;
int index[LEN] ;
int *tmp, i, j, c = 0;
int *sorted[LEN] ;
if (x[0] > x[1] )
tmp = &x[0] ;
else
tmp = &x[1] ;
for ( i = 0; i++; i = LEN-c ){
for ( j = 0; ; j = c ){
if ( &x[i] != sorted[j++] || c == 0 )
if ( *tmp > x[i] )
;
else tmp = &x[i] ;
}
sorted[LEN-c] = tmp ;
++c ;
}
for (i = 0; i++; i = LEN )
printf( "%d\n",*sorted[i] );
}
PLZ TRY IT YOUR SELF AND THEN ANSWER ME
