蔡子经数据结构3.2

#include <time.h>
#include <stdlib.h>
#define MAXN 100
int a[MAXN];
int top = 0;
typedef struct 
{
    int val;
    struct * next;
} node;

node* createNode()
{
    node* ret = (node*)malloc(sizeof(node));
    ret->next = NULL;
    ret->val = -1;
    return ret;
}

void Insert(node* pre, node* p, int x)
{
    while(p)
    {
        if(x < p->val)
            break;
        pre = pre->next;
        p = p->next;
    }
    node *in = createNode();
    in->val = x;
    in->next = p;
    pre->next = in;
}

int cmp(const void* a, const void* b)
{
    return *(int*)a - *(int*)b;
}

int main()
{
    srand(time(NULL));
    node* head = createNode();

    for(int i = 0; i < 10; ++i)
    {
        a[top++] = rand()%100;
        printf("%d ",a[top-1]);
    }
    puts("");
    for(int i = 0; i < top; ++i)
        Insert(head, head->next, a[i]);
    node *p = head->next;
    while(p)
    {
        printf("%d ",p->val);
        p = p->next;
    }
    puts("");
    qsort(a,top,sizeof(int),cmp);
    for(int i = 0; i < top; ++i)
        printf("%d ",a[i]);
    return 0;
}