#include <stdio.h>
#include <stdlib.h>
#define N 10
typedef  struct list
{  
	int  data;
   	struct list  *next;
}LNode;
void simpleselectsorlklist(LNode *&head)
{
	LNode *p,*q,*s;  
	int min,t;
	if(head==0||head->next==0) 
		return;
	for(q=head;q!=0;q=q->next)
	{
		min=q->data;
		s=q;
		for(p=q->next;p!=0;p=p->next)
		{
			if(min>p->data)
			{
				min=p->data; 
				s=p;
			}
		} 	
		if(s!=q)
		{
			t=s->data; 
			s->data=q->data; 
			q->data=t;
		}
	}
}
LNode *creatlist(int  *a)
{  
	LNode  *h,*p,*q;      
	int  i;
   	h=p=(LNode *)malloc(sizeof(LNode));
   	for(i=0; i<N; i++)
   	{  
	   q=(LNode *)malloc(sizeof(LNode));
       	   q->data=a[i];  
	   p->next=q;  
	   p=q;
   	}
   p->next=0;
   return h;
}
void outlist(LNode  *h)
{  
   LNode  *p;
   p=h->next;
   if (p==NULL)  
   		printf("\nThe list is NULL!\n");
   else
   {  
   	  printf("\nHead");
      do { 
	  	printf("->%d",p->data);  
	  	p=p->next;    
	  } while(p!=NULL);
      printf("->End\n");
  }
}
int main( )
{  
	LNode *A; 
	int sum;     
	int a[N]={1,3,40,16,10,31,4,81,6,8};
   	A=creatlist(a);
   	simpleselectsorlklist(A);
   	outlist(A);
   	return 0;
}