单链表的简单冒泡排序

int a[10] = {1,9,7,4,8,5,3,6,0,2};for (int i = 0; i < 10; i++){for (int j = 0; j < 10-i-1; j++){if (a[j+1]<a[j]){int temp = a[j+1];a[j+1] = a[j];a[j] = temp;}}}for (int i = 0; i < 10; i++)cout << a[i] << endl;

void sort(LinkList *L){int i, j, t;LinkList *p = L;int count = 0;while (p->link != NULL){count++;p = p->link;} for (i = 0; i<count - 1; i++)/* 冒泡法排序 */         {p = L;for (j = 0; j<count - i - 1; j++){if (p->data > p->link->data){t = p->data;p->data = p->link->data;p->link->data = t;}p = p->link;}     }}