【数据结构】（单链表）无序数组正序创建链表，插入排序

#include < iostream >
#include < cstdlib >
using namespace std;

// 结点的定义
typedef struct LNode{

int data;
struct LNode* next;	

}LNode;

// 创建单循环链表 (尾插法)
void createLinklist(LNode *&S,int a[],int n) // a??
{

LNode *s,*r; // s指向尾结点，r指向头结点,两个都要加 * 
S = (LNode *)malloc(sizeof(LNode));  // 创建头结点 
S->next = S; 
r = S;  // r始终指向终端结点 
for(int i=0;i<n;i++)
{
	s = (LNode *)malloc(sizeof(LNode));
	s->data = a[i];   // 给 s 赋值  
	s->next = r->next;  // 改变指针方向，双向 
	r->next = s;
	r = s;
}	

}

// 插入排序
void insertsort(LNode *&S)
{

LNode * pre,*q,*p,*p1;
p = S->next->next;
S->next->next = S;  // 新建一个循环链表 
while(p!=S){
	pre = S;
    q = pre->next;
	while(q!=S && q->data<p->data){
    	pre = pre->next;
	    q = q->next; 
    } 
    p1 = p->next;
	p->next = pre->next;
    pre->next = p;
    p = p1;	
}

}

// 显示
void display(LNode *S)
{

LNode* p;
p = S->next;
while(p != S){
	cout<<p->data<<" ";
    p = p->next; 
}
cout<<endl;

}

// 销毁链表
void destroy(LNode *&S)
{

LNode * p;
p = S->next;
while(p != S){
	LNode* tmp = p;
    p = p->next; 
    free(tmp);
}
free(S);

}

int main()
{

int a[] = {3,6,5,9,8,0};
LNode* L;
createLinklist(L,a,6);
display(L);
insertsort(L);
display(L);
return 0;

}