(Algorithm introduction Exercise solution exercise2.3-4) recursive version insert sort

There's nothing more to say, just look at the code:

#include <stdio.h>

void display (int array[], int size)
{
int i;
for (i = 0; i < size; ++i)
{
printf ("%d", Array[i]);
}

printf ("\ n");
}

void Insert_sort (int array[], int size)
{
if (Size > 1)
{
Insert_sort (array, SIZE-1); 　　　　　　　

Int temp = array[size-1];
int i;
for (i = size-2 i >= 0; i)
{
if (temp < array[i])
{
Array[i + 1] = Array[i]; 　　　　　　　　　　　
}
Else
{
break;
　　　
}

Array[i + 1] = temp;
　　　
}

int main ()
{
int array[] = {4,1,5,2,8};
Insert_sort (array, sizeof (array)/sizeof (int));

Display (array, sizeof (array)/sizeof (int));

return 0;
}

BTW: I found my ability to write recursive algorithms is not very strong, always do not grasp the point, but also to exercise more.