1、include include using namespace std;/函數(shù)結(jié)果狀態(tài)代碼define OK 1define ERROR 0define OVERFLOW -2/雙向鏈表/Status是函數(shù)的返回值類型，其值是函數(shù)結(jié)果狀態(tài)代碼 typedef int Status;typedef struct DuLNode int data;struct DuLNode *prior,*next; DuLNode, *DuLinkList;/初始化/銷毀鏈表/后插法創(chuàng)立雙向鏈表/雙向冒泡排序/輸出鏈表/初始化/銷毀鏈表/后插法創(chuàng)立雙向鏈表/雙向冒泡排序/輸出鏈表Status InitList

2、(DuLinkList &L);Status DestroyList(DuLinkList &L);void CreateList_R(DuLinkList &L,int L_Datar int n); void DuplexSort(DuLinkList &L);void PrintList(DuLinkList L);int main() int n; coutcu請輸入鏈表長度：， cinn;int *lData=new int n;coutcu請輸入關(guān)鍵字以空格隔開： for(int i=0;ilDatai; DuLinkList 1;InitList(1);CreateList_R(

3、1,IData,n);DuplexSort(1);coutcc”排序結(jié)果：， PrintList (1);delete(IData);DestroyList (1);return 0; )/初始化Status InitList (DuLinkList &L)/構(gòu)造一個空的雙向鏈表LL=new DuLNode;/初始化鏈表L的頭結(jié)點L-prior=L; L-next=L; return OK; /銷毀鏈表Status DestroyList(DuLinkList &L) while(L)(DuLNode *p=L;L=L-next;delete p;/釋放空間) return OK; )/后插法

4、創(chuàng)立雙向鏈表void CreateList_R(DuLinkList &L,int L_Data, int n) /正位序輸入n個元素的值，建立帶表頭結(jié)點的會向鏈表LDuLinkList p=new DuLNode;p-data=L_Data0;L-next=p;p-prior=L;p-next=NULL;for(int i=l;idata=L_Datai;p-prior=L;L-next-prior=p;p-next=L-next; L-next=p; /輸出鏈表void PrintList(DuLinkList L) /依次輸出鏈表中的數(shù)據(jù)DuLinkList p=L-next;while

5、(p!=NULL) (coutdatanext;coutnext=tail) break;p=head-next;exchange=O;while(p-next!=tail)(if(p-data p-next-data)temp=p-next; exchange=l; p-next=temp-next; if(temp-next!=NULL) temp-next-prior=p;temp-next=p;p-prior-next=temp; temp-prior=p-prior; p-prior=temp; else p=p-next;tail=p;p=tail-prior;while (exchange & p-prior!=head) (if(p-data prior-data)( temp=p-prior; exchange=l;p-prior=temp-prior; temp-prior-next=p; temp-prior=p;p-next-prior=temp;temp-next=p-next; p-next=temp;else p=p-prior;) head=p;)/有交換/先將結(jié)點從鏈表上摘下/將temp插到結(jié)點*p前/無交換，指針后移/準備向上起泡/交換兩結(jié)點指針，涉及6條鏈/有交換/先將temp結(jié)點從鏈表上摘下/