[GLD-EXAM] 单链表的快排算法 (利用头插法)

 /********************************************************************* DESCRIPTION: Glodon20091123 ** AUTHOR: Neesky** DATE:2009-11-23********************************************************************//** include files **/#include <iostream>using namespace std;/** * Struct Node Definition */typedef struct node{ int k; node *next;}Node,*LinkList;/** * Initilize the Link List With the Array * * @author NeeSky (2009-11-23) * * @param arr * @param N * * @return Node* */LinkList InitLinkList(int arr[],int N){ if(N<1)return NULL; Node *p=new Node,*head=p; p->k=arr[0];p->next=NULL; for(int i=1;i<N;++i) { p->next=new Node;p=p->next; p->k=arr[i];p->next=NULL; } return head;}/** * Visit Link List * * @author NeeSky (2009-11-23) * * @param linkList */void VisitLinkList(LinkList linkList){ if(linkList==NULL)return; Node *p=linkList;cout<<" "<<p->k; p=p->next; while(p!=NULL) { cout<<" -> "<<p->k; p=p->next; } cout<<endl; return;}/** * Partition Function --Head Insert Function * * @author NeeSky (2009-11-23) * * @param linkList * @param tailNode * * @return Node* */Node* Partition(LinkList& linkList,Node* tailNode=NULL){ Node* border=linkList;/*border point the head of linkList*/ Node *p=linkList->next,*pre=linkList; while(p!=tailNode) { if(p->k<border->k) { pre->next=p->next;p->next=linkList; linkList=p;p=pre->next; continue; } pre=p; p=pre->next; } return border;}/** * Quick Sorting Function * * @author NeeSky (2009-11-23) * * @param linkList * @param tailNode */void QuickSortLinkList(LinkList& linkList,Node* tailNode=NULL){ if(linkList!=tailNode&&linkList->next!=tailNode)/*more than two node*/ { Node* p=Partition(linkList,tailNode); QuickSortLinkList(linkList,p); /*left */ QuickSortLinkList(p->next,tailNode); /*right*/ } return;}/** * Sorting two disorder linklist * * @author NeeSky (2009-11-23) */Node* CombineTwoDisOrderLinkList(LinkList& linkList1,LinkList& linkList2){ LinkList link=linkList1; Node *p=linkList1; while(p->next!=NULL)p=p->next; p->next=linkList2; QuickSortLinkList(linkList1); return linkList1;}/** * Solve the problem of LinkList * * @author NeeSky (2009-11-23) */void SolveProblemLinkList(int arr[],int N){ LinkList sList=InitLinkList(arr,N);cout<<"/nBefor Quick Sorting:"; VisitLinkList(sList); QuickSortLinkList(sList);cout<<"After Quick Sorting:"; VisitLinkList(sList); return;}/** * Solve the problem of two disorder link list * * @author NeeSky (2009-11-23) * * @param arra * @param NA * @param arrb * @param NB */void SolveProblemTwoLinkList(int arra[],int NA,int arrb[],int NB){ LinkList sList1=InitLinkList(arra,NA); cout<<"/nBefor Quick Sorting:"<<endl; cout<<" 1-link:";VisitLinkList(sList1); LinkList sList2=InitLinkList(arrb,NB); cout<<" 2-link:";VisitLinkList(sList2); LinkList sList=CombineTwoDisOrderLinkList(sList1,sList2); QuickSortLinkList(sList);cout<<"After Quick Sorting:"; cout<<" link:";VisitLinkList(sList);cout<<endl; return;}/** * The Main Programming * * @author NeeSky (2009-11-23) * * @param argc * @param argv * * @return int */int main (int argc, char *argv[]){ int Arra[10]={6,7,8,9,10,1,2,3,4,5}; int Arrb[10]={6,7,8,9,10,1,2,3,4,5}; SolveProblemLinkList(Arra,10); SolveProblemTwoLinkList(Arra,10,Arrb,10); return(0);}
 输出:

Befor Quick Sorting: 6 -> 7 -> 8 -> 9 -> 10 -> 1 -> 2 -> 3 -> 4 -> 5
After Quick Sorting: 1 -> 2 -> 3 -> 4 -> 5 -> 6 -> 7 -> 8 -> 9 -> 10

Befor Quick Sorting:
   1-link: 6 -> 7 -> 8 -> 9 -> 10 -> 1 -> 2 -> 3 -> 4 -> 5
   2-link: 6 -> 7 -> 8 -> 9 -> 10 -> 1 -> 2 -> 3 -> 4 -> 5
After Quick Sorting:     link: 1 -> 1 -> 2 -> 2 -> 3 -> 3 -> 4 -> 4 -> 5 -> 5 -> 6 -> 6 -> 7 -> 7 -> 8 -> 8 -> 9 -> 9 -> 10 -> 10