#include <iostream>
using namespace std;
typedef struct list
{
int data;
struct list * pNext;
} List, *pList;
pList CreatHeadNode ();
pList CreatNewNode ();
void BuildList (pList);
void PrintList (pList);
void SortList (pList);
int main ()
{
int n;
pList pHead = CreatHeadNode ();
BuildList (pHead);
SortList (pHead);
PrintList (pHead);
}
pList CreatHeadNode ()
{
pList pNewNode = new List;
if (pNewNode == NULL)
exit (-1);
pNewNode->data = 0;
pNewNode->pNext = NULL;
return pNewNode;
}
pList CreatNewNode ()
{
pList pNewNode = new List;
if (pNewNode == NULL)
exit (-1);
pNewNode->pNext = NULL;
cin >> pNewNode->data;
if (pNewNode->data == 0)
return NULL;
return pNewNode;
}
void BuildList (pList pHead)
{
pList pTail = pHead;
pList pNewNode = CreatNewNode ();
while (pNewNode)
{
pTail->pNext = pNewNode;
pTail = pNewNode;
pNewNode = CreatNewNode ();
}
}
void PrintList (pList pHead)
{
pList p = pHead->pNext;
while (p)
{
cout << p->data << " ";
p = p->pNext;
}
}
void SortList (pList pHead)
{
pList p = pHead->pNext;
pList q = p->pNext;
int t;
while (p)
{
q = p->pNext;
while (q)
{
if (p->data > q->data)
{
t = p->data;
p->data = q->data;
q->data = t;
}
q = q->pNext;
}
p = p->pNext;
}
}
编写在非递减有序链表中插入一个元素(整型),使链表元素仍有序的函数(必须采用函数实现,否则不算成绩),并利用该函数建立一个非递减有序单向链表,之后输出这个有序的单链表。
最新推荐文章于 2023-09-25 11:14:25 发布