void straightinsertsort(lklist *&head)
{
	lklist *s,*p,*q;
	int t;
	if (head==0||head->next==0) 
		return;
	else{
		for(q=head,p=head->next;p!=0;p=q->next)
		{
			for(s=head;s!=q->next;s=s->next) 
				if(s->data>p->data) 
					break;
			if(s==q->next)
				q=p;
			else{
				q->next=p->next;
				p->next=s->next; 
				s->next=p;
				t=p->data;
				p->data=s->data;
				s->data=t;
			}
		}
	} 
}