创建链表时，就是插入排序
    链表排序
    先插入后排序

    1. #include <stdio.h>
    2. #include<stdlib.h>
    3. #include<math.h>
    4. #include<string.h>
    5. #include<stdbool.h>
    6. typedef struct Node {
    7.     int data;
    8.     struct Node* pnext;
    9. }NODE,*pNode; // 创建指针
    10. pNode CreateList(int n) { // 头插法
    11.     int i;
    12.     int data=0;
    13.     pNode phead = NULL, pnew = NULL;
    14.     for (i = 0; i < n; i++) {
    15.         pnew = (pNode)malloc(sizeof(NODE));
    16.         scanf("%d", &data);
    17.         if (pnew != NULL) {
    18.             pnew->data = data;
    19.             pnew->pnext = phead;
    20.             phead = pnew;
    21.         }
    22.     }
    23.     return phead;
    24. }
    25. void PrintList(pNode p,int pos) {
    26.     int i = 0;
    27.     for(i=0;i<pos-1;i++)p = p->pnext;
    28.     printf("%d\n", p->data);
    30. }
    31. void buble_sort(pNode p ,int n) {
    32.     int i = 0;
    33.     int j = 0;
    34.     int temp = p->data;
    35.     pNode tmp = p;  // 创建的是指向结点的指针
    36.     for (i = 0; i < n; i++) {
    37.         for (j =0; j < n-i-1; j++) {
    38.             if (p->data>= p->pnext->data) {
    39.                 temp = p->data;
    40.                 p->data = p->pnext->data;
    41.                 p->pnext->data = temp;
    42.             }
    43.             p = p->pnext;
    44.         }
    45.         p = tmp;
    46.     }
    47. }
    48. int main() {
    49.     int n;
    50.     scanf("%d", &n);
    51.     pNode head = CreateList(n);
    52.     buble_sort(head, n);
    53.     scanf("%d", &n);
    54.     PrintList(head,n);
    55.     return 0;
    57. }