单链表排序[表格借鉴].doc
#include<iostream>using namespace std;struct Cnodeint data;Cnode *next;Cnode *creat(Cnode *head) Cnode *pnew,*pcur;pcur=head;head->next=NULL;pnew=new Cnode;cout<<"请输入你的元素:"cin>>pnew->data;pcur->next=pnew;pcur=pnew;while(pnew->data!=0)pnew=new Cnode;cin>>pnew->data;pcur->next=pnew;pcur=pnew;pcur->next=NULL; return head;Cnode *order(Cnode *head) Cnode *p,*q; int big; p=head->next; q=p->next; while(q!=NULL) if(p->data<q->data) big=p->data; p->data=q->data; q->data=big; q=q->next; if(q=NULL) p=p->next; q=p->next; return head;void show(Cnode *head)Cnode *ph;ph=head->next;while(ph!=NULL)cout<<ph->data<<","ph=ph->next;void main()Cnode *head,*op,*ip;head=new Cnode;head->next=NULL;op=creat(head);ip=order(op);show(ip);2表格详d