C++チェーンテーブル直接挿入ソート
1283 ワード
#include
/*
* Created by HarvestWu on 2018/07/24.
*/
using namespace std;
typedef int ElemType;
typedef int Status;
typedef struct LNode
{
ElemType data;
struct LNode *next;
}LNode, *LinkList;
//
void CreateList_L(LinkList &L, ElemType R[],int n)
{
L = (LinkList)malloc(sizeof(LNode));
L->next = NULL;
LinkList p,t;
t = L;
for (int i = 0; i < n; i++)
{
p = (LinkList)malloc(sizeof(LNode));
p->data = R[i];
t->next = p;
t = p;
}
t->next = NULL;
}
//
void Sort(LinkList &L)
{
LinkList p, p1, q, pre;
if (L->next != NULL)
{
p = L->next->next;
L->next->next = NULL;
while (p != NULL)
{
pre = L; //pre q
q = pre->next;
while (q != NULL&&q->data < p->data)//
{
pre = q;
q = q->next;
}
p1 = p->next;// p pre p
p->next = pre->next;
pre->next = p;
p = p1;
}
}
}
//
void Display(LinkList &L)
{
LinkList p;
p = L->next;
while (p)
{
cout<data<next;
}
cout << endl;
}
int main()
{
LinkList L;
ElemType R[] = { 1, 8, 6, 9, 7, 12, 0, 3, 8, 4, 5 };
CreateList_L(L, R, 10);
Sort(L);
Display(L);
return 0;
}