选择排序:
void select_Sort(Fruit* point){
Fruit *t=point;
for(Fruit *temp_point=point;temp_point!=NULL; temp_point=temp_point->next){
for(Fruit *temp2_point=temp_point; temp2_point->next !=NULL; temp2_point=temp2_point->next){
if(temp2_point->price > temp2_point->next->price){
strcpy(t->name,temp2_point->next->name);
t->price=temp2_point->next->price;
strcpy(temp2_point->next->name,temp2_point->name);
temp2_point->next->price=temp2_point->price;
strcpy(temp2_point->name,t->name);
temp2_point->price=t->price;
}
}
}
}
冒泡排序:
void bubbleSort(Fruit* point){
Fruit *cur,*tail;
char temp1[20];
cur=point;
tail=NULL;
if(cur==NULL||cur->next==NULL){
return;
}
while(cur!=tail){
while(cur->next!=tail){ //逐个减一,从倒数第一个、倒数第二个、倒数第三个到... 第一个
if(cur->price > cur->next->price){
double temp=cur->price;
cur->price=cur->next->price;
cur->next->price=temp;
strcpy(temp1,cur->name);
strcpy(cur->name,cur->next->name);
strcpy(cur->next->name,temp1);
}
cur=cur->next;
}
tail=cur;
cur=point;
}
}