//=============冒泡排序====================
void bubbleSort(NODE *head)
{
NODE *cur, *next, *end;
cur = head -> next;
end = NULL;
while(cur != end)
{
for(next = cur->next; next != end; cur = cur -> next, next = next->next)
{
if(cur -> data > next -> data)
{
int tmp = cur->data;
cur->data = next->data;
next->data = tmp;
}
}
end = cur;
cur = head->next;
}
}
int main()
{
NODE *head,*p;
head=create();
p=head->next;
bubbleSort(head);
while(p)
{
printf("%d ",p->data);
p=p->next;
}
printf("\n");
return 0;
}