链表实现选择排序有两种方法,一种是交换节点内的数据,比较简单。我这里使用的是第二种方法,交换节点。
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#pragma warning(disable:4996)
typedef struct Node {
int data;
struct Node *next;
}node;
int main()
{
node *head = malloc(sizeof(node));
node *p,*q,*min,*r;
int i;
head->next = NULL;
head->data = 0;
p = head;
for (i = 0; i < 6; i++)
{
q = malloc(sizeof(node));
scanf("%d", &q->data);
p->next = q;
p = q;
}
p->next = NULL;
p = head;
while (p->next)
{
min = p;
q = p->next;
while (q->next)
{
if (min->next->data > q->next->data)
min = q;
q = q->next;
}
if (min != p)
{
r = min->next;
min->next = min->next->next;
r->next = p->next;
p->next = r;
p = p->next;
}
else
p = p->next;
}
p = head->next;
while (p)
{
printf("%d\n", p->data);
p = p->next;
}
return 0;
}