链表的插入排序

　　

#include <cstring>
#include <cstdio>
using namespace std;

typedef int type;

template<class T>
struct Node {
    T data;
    Node *next;
    Node<T>() {
        data = 0;
        next = NULL;
    }
};

Node<type> *head = new Node<type>();

template<class T> 
void add(Node<T> *n0) {
    Node<T> *pr = head;
    Node<T> *now = head -> next;
    while(now) {
        if(now -> data > n0 -> data) {
            n0 -> next = now;
            pr -> next = n0;
            return ;
        }
        pr = now;
        now = now -> next;
    }
    pr -> next = n0;
}

template<class T>
void print() {
    Node<T> *p = head -> next;
    while(p) {
        printf("%d ", p -> data);
        p = p -> next;
    } puts("");
}


int main() {
    int n;
    type x;
    while(cin >> n) {
        cin >> x;
        Node<type> *p = new Node<type>();
        p -> data = x;
        p -> next = NULL;
        head -> next = p;
        for(int i = 1; i < n; i++) {
            cin >> x;
            Node<type> *n0 = new Node<type>();
            n0 -> data = x;
            add<type>(n0);
        }
        print<type>();
    }
}