使带头节点的单链表元素递增有序

#include "stdafx.h"
#include<stdio.h> 
#include<malloc.h> 
#include<stdlib.h>
typedef int type;
typedef struct lnode //定义链表结点的数据结构 
{
    int data;
    struct lnode *next;
}Lnode;
typedef Lnode node;
typedef struct dnode//定义双链表结点的数据结构 
{
    int data;
    struct dnode *lnext;
    struct dnode *rnext;
}Dnode;

void bubblesort6(node *h)//冒泡排序交换结点值
{
    int w, i, change, j;
    node *tem;
    for (i = getlength(h), change = 1; i>1 && change; i--)
    {
        change = 0;
        for (j = 1; j<i; ++j)
        if (get(h, j)->data>get(h, j + 1)->data)
        {
            w = get(h, j)->data;
            get(h, j)->data = get(h, j + 1)->data;
            get(h, j + 1)->data = w;
            change = 1;
        }
    }

}