void linkBubble(link header,int aLen)
{//链表的冒泡排序
for (int i = aLen-1;i >= 0;--i)
{
for (link q = header;q->index < i;q = q->next)
{
if (q->data > q->next->data)
{
int temp = q->data;
q->data = q->next->data;
q->next->data = temp;
}
}
}
}