冒泡排序的链表实现

#include<stdio.h>
typedef struct node{
int num;
struct node *next;


}NODE;


NODE* makeList(int*,size_t);
NODE* sort(NODE* list);


int main(){
NODE* head;
NODE* curr;

int a[]={1,2,4,6,3,5};
head=makeList(a,6);
curr=head;
head=sort(curr);

while(curr){
printf("%d\t",curr->num);
curr=curr->next;
}
return 0;
}
NODE* makeList(int* list,size_t len){
size_t i;
NODE* head;
NODE* ptr;
int* list_curr;



head=NULL;
list_curr=list;

for(i=0;i<len;i++){
ptr=(NODE*)malloc(sizeof(NODE));
ptr->num=*list_curr;
ptr->next=head;
head=ptr;
list_curr++;
}
return head;

}
NODE* sort(NODE* list){
NODE* list_1;
NODE* list_2;
NODE* list_min;
int i,j;
int temp;



list_min=NULL;
list_1=list;


while(list_1->next){
list_2=list;
while(list_2->next!=list_min){
if(list_2->num>list_2->next->num){
temp=list_2->num;
list_2->num=list_2->next->num;
list_2->next->num=temp;
}
list_2=list_2->next;


}
list_min=list_2->next;
list_1=list_1->next;

}
return list;


}