뭔진 모르지만 그냥 정렬

#include <stdio.h>

#include <time.h>

#include <stdlib.h>

int **tree, arr[25]={0,},arr2[25]={0,},arr3[25]={0,},arr4[25]={0,};

void insert(int a, int arr[], int i)

{

arr[0] = a;

while(a < arr[i])

{

arr[i+1] = arr[i];

i--;

}

arr[i+1] = a;

}

void isort(int arr[], int n)

{

int j;

for(j=2; j <=n;j++)

{

int temp = arr[j];

insert(temp, arr, j-1);

}

}

int compare()

{

tree[4] = arr;

tree[5] = arr2;

tree[6] = arr3;

tree[7] = arr4;

tree[4] > tree[5] ? tree[2] = tree[5]: tree[2] = tree[4] ;

tree[6] > tree[7] ? tree[3] = tree[7]: tree[3] = tree[6] ;

tree[2] > tree[3] ? tree[1] = tree[3]: tree[1] = tree[2] ;

return *(tree[1]);

}

void main()

{

//int arr[10] = {0,9,8,7,6,5,4,3,2,1};

int finish = sizeof(arr)/sizeof(int);

int i;

srand((unsigned int) time (NULL));

printf("배열 a1 \n");

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

{

arr[i] = rand()%999;

printf("%-4d ",arr[i]);

}

isort(arr,finish-1);

printf("\n\n배열 a2 \n");

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

{

arr2[i] = rand()%999;

printf("%-4d ",arr2[i]);

}

isort(arr2,finish-1);

printf("\n\n배열 a3 \n");

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

{

arr3[i] = rand()%999;

printf("%-4d ",arr3[i]);

}

isort(arr3,finish-1);

printf("\n\n배열 a4 \n");

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

{

arr4[i] = rand()%999;

printf("%-4d ",arr4[i]);

}

isort(arr4,finish-1);

printf("\n\n정렬 후");

printf("\n\n배열 a1 \n");

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

printf("%-4d ",arr[i]);

printf("\n\n배열 a2 \n");

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

printf("%-4d ",arr2[i]);

printf("\n\n배열 a3 \n");

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

printf("%-4d ",arr3[i]);

printf("\n\n배열 a4 \n");

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

printf("%-4d ",arr4[i]);

// for(int i = 0; i < finish; i++)

// printf("%d ",arr[i]);

printf("\n%d ",compare);

}