(带头结点)单链表排序(递增)
题目问题描述:
带头节点的单链表进行递增排序(直接插入排序思想)
结果截图:
实现代码:
//(带头结点)单链表排序(递增)
#include<stdio.h>
#include<stdlib.h>
typedef struct Node{
int data;
struct Node* next;
}Node,*Linklist;
Linklist createList();
void printList(Linklist L);
Linklist Chsort(Linklist &L);
int main(){
Linklist L = createList();
printList(L);
Chsort(L);
printf("排序后:\n");
printList(L);
}
Linklist Chsort(Linklist &L){
Node* p = L->next;
Node* r = p->next;
Node* pre = NULL;
p->next = NULL;
p = r;
while(p){
r = p->next;
pre = L;
while(pre->next != NULL && pre->next->data < p->data){
pre = pre->next;
}
p->next = pre->next;
pre->next = p;
p = r;
}
return L;
}
Linklist createList(){ //创建链表
int len = 0;
int data;
Node* r = NULL;
Linklist L = (Node*)malloc(sizeof(Node));//创建头节点
L->next = NULL;
r = L;
printf("链表长: ");
scanf("%d",&len);
printf("链表数值: ");
for(int i = 0;i < len;i++){
Node* p = (Node*)malloc(sizeof(Node));
p->next = NULL;
getchar();
scanf("%d",&data);
p->data = data;
r->next = p; // 尾插法
r = p;
}
return L;
}
void printList(Linklist L){ //打印
Node* p = L->next;
while(p){
printf("%d ",p->data);
p = p->next;
}
printf("\n");
}