typedef struct Node{
	int data;
	Node *pNext;
}NODE,PNODE;

void sort_list(PNODE pHead){
	int i,j,t;
	PNODE p,q;
	int len =getLength(pHead);
	for(i=0,p=pHead->pNext;i<len-1;++i,p=p->pNext){
		for(j = i+1,q=p->pNext;j<len-1;++j,q=q->pNext){
			if(p->data>q->data){	//类似于数组中的a[i]>a[j]
				t = p->data;		
				p->data = q->data;
				q->data = t;
			}
		}
	}
}

int  getLength(PNODE pHead){
	PNODE p = pHead->pNext;
	int len = 0 ;
	while( NULL != P ){
		++len;
		p=p->pNext;
	}
	return len;
}