冒泡排序
void sort_list(PNODE pHead)
{
int i,j,t;
int len = length_list(pHead);
PNODE p,q;
for (i=0,p=pHead->pNext; i<len-1; ++i,p=p->pNext)
{
for(j=i+1,q=p->pNext;j<len ; ++j,q=q->pNext)
{
if(p->data > q->data)//类似于数组中的:a[i]>a[j]
{
t = p->data;//类似于数组中的:t=a[i]
p->data = q->data;//类似于数组中的:a[i]=a[j]
q->data = t;//类似于数组中的:a[j]=t
}
}
}
return ;
}
链表的创建,遍历,插入,删除,是否为空,链表长度,冒泡排序函数合集
#include<stdio.h>
#include<malloc.h>
#include<stdlib.h>
typedef struct Node
{
int data;
struct Node *pNext;
}NODE, *PNODE;
//函数声明
PNODE create_list(void);
void traverse_list(PNODE pHead);
bool is_empty(PNODE pHead);
int length_list(PNODE pHead);
bool insert_list(PNODE pHead, int pos, int val);
bool delet_list(PNODE pHead, int pos, int *pVal);
void sort_list(PNODE pHead);
int main(void)
{
PNODE pHead = NULL;
int val;
pHead = create_list();
traverse_list(pHead);
length_list(pHead);
int len = length_list(pHead);
printf("链表的长度为:%d\n",len);
traverse_list(pHead);
insert_list(pHead, 3, 15);
printf("插入成功!\n");
traverse_list(pHead);
if(delet_list(pHead, 2,&val))
{
printf("删除成功!\n");
printf("删除元素是:%d\n",val);
}
else
printf("删除失败!\n");
traverse_list(pHead);
sort_list(pHead);
printf("冒泡排序成功!\n");
traverse_list(pHead);
return 0;
}
PNODE create_list(void)
{
int len;
int i;
int val;
PNODE pHead = (PNODE)malloc(sizeof(NODE));
if(NULL == pHead)
{
printf("程序分配失败,程序终止!\n");
exit(-1);
}
PNODE pTail = pHead;
pTail->pNext = NULL;
printf("请输入你需要生成的链表节点的个数:len = ");
scanf("%d",&len);
for(i=0; i<len; ++i)
{
printf("请输入第%d个节点的值:", i+1);
scanf("%d",&val);
PNODE pNew = (PNODE)malloc(sizeof(NODE));
if(NULL == pNew)
{
printf("分配失败,程序终止!\n");
exit(-1);
}
pNew->data = val;
pTail->pNext = pNew;
pNew->pNext = NULL;
pTail = pNew;
}
return pHead;
}
void traverse_list(PNODE pHead)
{
PNODE p = pHead->pNext;
while(NULL != p)
{
printf("%d\n" ,p->data);
p = p->pNext;
}
printf("\n");
return;
}
bool is_empty(PNODE pHead)
{
PNODE p = pHead->pNext;
if(p == NULL)
return true;
else
return false;
}
int length_list(PNODE pHead)
{
PNODE p = pHead->pNext;
int len = 0;
while(NULL != p)
{
len++;
p = p->pNext;
}
return len;
}
bool insert_list(PNODE pHead, int pos, int val)
{
PNODE p = pHead;
int i = 0;
while(i<pos-1 && p != NULL)
{
p = p->pNext;
++i;
}
if(NULL == p || i>pos-1)
{
printf("程序结束!\n");
exit(-1);
}
PNODE pNew = (PNODE)malloc(sizeof(NODE));
if(NULL == pNew)
{
printf("动态内存分配失败,结束程序!\n");
exit(-1);
}
pNew->data = val;
PNODE q = p->pNext;
p->pNext = pNew;
pNew->pNext = q;
return true;
}
bool delet_list(PNODE pHead, int pos, int *pVal)
{
PNODE p = pHead;
int i = 0;
while(i<pos-1 && p != NULL)
{
p = p->pNext;
++i;
}
if(NULL == p || i>pos-1)
{
printf("程序结束!\n");
exit(-1);
}
PNODE q = p->pNext;
*pVal = q->data;
p->pNext = p->pNext->pNext;
free(q);
return true;
}
void sort_list(PNODE pHead)
{
int i;
int j;
int t;
int len = length_list(pHead);
PNODE p,q;
for(i = 0,p = pHead->pNext; i<len-1; ++i,p = p->pNext)
for(j = i+1, q = p->pNext; j<len; ++j, q = q->pNext)
{
if(p->data >q->data)
{
t = p->data;
p->data = q->data;
q->data = t;
}
}
}
结果: