struct llist_node* llist_sort(struct llist_node* head)
{
struct llist_node* tmp = head;
struct llist_node* begin = head;
if (head==NULL&&head->next==NULL)
{
return head;
}
while (begin)
{
tmp = head;
//flag=0;
while (tmp&&tmp->next)
{
if (tmp->value>tmp->next->value)
{
int value = tmp->value;
tmp->value = tmp->next -> value;
tmp->next->value = value;
//flag=1; 这个当一次没有发生变化则证明已排好序
}
tmp = tmp->next;
}
/*
if (flag == 0)
{
return head;
}
*/
begin = begin->next;
}
return head;
}