#include "stdafx.h"
#include "malloc.h"
typedef struct Node
{
char data;
Node *next;
}List;
// 创建单链表
void CreateList(List *&L, char a[], int n)
{
List *s,*r;
L = (List *)malloc(sizeof(List));
L->next = NULL;
r = L;
for (int i = 0; i < n; i++)
{
s = (List *)malloc(sizeof(List));
s->data = a[i];
r->next = s;
r = s;
}
r->next = NULL;
}
// 使用了排序算法中的插入排序
void Sort(List *&head)
{
List *p = head->next, *q, *r; // p指向第一个节点
if(p!=NULL)
{
r = p->next; // r指向第二个节点
p->next = NULL; // p的后继节点为NULL
p = r; // p指向第一个节点
while (p!=NULL)
{
r = p->next;
q = head;
while (q