单链表排序

//假设由小到大进行排序
Node*  Sort(Node* head)
{
node *p p = head;
node *p q= p->next;
int m,n,temp;
int nlength = length(head);
    if(NULL == head || NULL == head)
{
return head;
}

while(NULL != q->next)
{
m = p->data;
n = q->data;
if(m>n)
{
temp = m;
m = n;
n = temp;
}
p = p->next;
q = q->next
}
          return head;

}