不带头结点的单向链表 排序（递归）

#include <stdio.h>
#include <stdlib.h>
#include <time.h>

struct node 
{
    int num;
    struct node * next;
};

typedef struct node Node;
typedef struct node * Link;

void creat_link(Link * head)
{
    *head = NULL;
}

void head_insert(Link * head,Link new_node)
{
    new_node->next = *head;
    *head = new_node;
}

void tail_insert(Link * head, Link new_node)
{
    Link p = *head;

    if( p == NULL )
    {
        *head = new_node;
        new_node->next = NULL;
    }
    else
    {
        while(p->next != NULL)
        {
            p = p->next;
        }

        p->next = new_node;
        new_node->next = NULL;
    }
}

void display(Link head)
{
    Link p = head;

    int i = 1;

    while(p != NULL)
    {
        printf("new_node%d->num = %d\n",i,p->num);
        p = p->next;
        i++;
    }
}

void release(Link *head)
{