单链表排序

#include "stdafx.h"#include <stdlib.h> // For _MAX_PATH definition#include <stdio.h>#include <malloc.h>typedef struct node { int i; node* next; }NODE;NODE* bubblesort(NODE *head) { NODE *q,*tail,*p=(NODE*)malloc(sizeof(NODE)); p->next = head; head = p; tail = NULL; while(tail != head->next) { p = head; q = p->next; while(q->next != tail) { if (p->next->i < q->next->i) { p->next = q->next; q->next = q->next->next; p->next->next = q; } p = p->next; q = p->next; } tail = q; } p = head->next; free(head); return p; }