數(shù)據(jù)結(jié)構(gòu)實(shí)驗(yàn)4

數(shù)據(jù)構(gòu)造實(shí)驗(yàn)報(bào)告4（一）題目按下述原則編寫(xiě)快排的非遞歸算法：一趟排序以后，若子序列已有序(無(wú)互換)，則不參加排序，不然先對(duì)長(zhǎng)度較短的子序列進(jìn)行排序，且將另一子序列的上、下界入棧保留；若待排記錄數(shù)<=3，則不再進(jìn)行切割，而是直接進(jìn)行比較排序。測(cè)試實(shí)例：{49386597761327498821105}（二）算法思路成立儲(chǔ)存序列上下界的棧序列。對(duì)棧頂作以下判斷：A.若棧頂中記錄的頭與尾相距小于3，對(duì)對(duì)應(yīng)的子序列進(jìn)行排序，而后出棧，進(jìn)入(3)；B.若棧頂中記錄的頭與尾相距大于等于3，則進(jìn)行分塊，判斷分塊能否有序，a.若兩分塊都有序，則出棧，進(jìn)入(3)；b.若只有一分塊有序，則改變棧頂內(nèi)容為無(wú)序分塊內(nèi)容，進(jìn)入(3)；c.若兩分塊都無(wú)序，則改變棧頂內(nèi)容為較長(zhǎng)的無(wú)序塊，而后把較短的無(wú)序塊壓進(jìn)棧。進(jìn)入

(3)(3)重復(fù)(2)的操作，直至棧空，獲得最后結(jié)果。（三）程序構(gòu)造定義的構(gòu)造體及申明#defineMAX_SEQ100//最大輸入數(shù)typedefstruct_stack{intleft;//lowerboundintright;//upperboundstruct_stack*next;}qstack;//tostorethechildsequence'slowerboundandupperbound主函數(shù)變量及其說(shuō)明變量名

說(shuō)明intarray[MAX_SEQ]

儲(chǔ)存輸入序列intn

輸入的序列長(zhǎng)度重要函數(shù)以及說(shuō)明函數(shù)名功能變量說(shuō)明boolsorted(int*arr,intleft,intright)判斷序列能否有序arr為等排序的數(shù)組，left為下界，right為下界。有序或許是left>right時(shí)返回true，不然返回falsevoidsort(int*arr,intleft,intright)給三個(gè)或三個(gè)以下的arr為等排序的數(shù)組；left為序列排序下界；right為下界。voidqsort(int*arr,intleft,intright)迅速排序同上（四）源碼#include<iostream>#defineMAX_SEQ100usingnamespacestd;typedefstruct_stack{intleft;//lowerboundintright;//upperboundstruct_stack*next;}qstack;//tostorethechildsequence'sleftandrightvoidsort(int*arr,intleft,intright){for(inti=left;i<=right;i++){

//sortchildsequencelessthan3intk=i;for(intj=i+1;j<=right;j++){if(arr[k]>arr[j])k=j;}if(k!=i){intt;t=arr[k];arr[k]=arr[i];arr[i]=t;}}}boolsorted(int*arr,intleft,intright){for(inti=left;i<right;i++){if(arr[i]>arr[i+1])returnfalse;}returntrue;}voidqsort(int*arr,intleft,intright){qstack*head;head=newqstack;head->left=left;head->right=right;head->next=NULL;qstack*p;while(head!=NULL){if(head->right-head->left<3){//iflessthan3,sortandpopsort(arr,head->left,head->right);p=head;head=head->next;deletep;}else{//generally,separatethesequenceintml=head->left,mr=head->right;intmm=ml;intk=arr[mm];//findtheposition,thekeypartofquicksortwhile(ml<mr){if(mm==ml){if(arr[mr]>=k)mr--;else{arr[mm]=arr[mr];mm=mr;}}if(mm==mr){if(arr[ml]>k){arr[mm]=arr[ml];mm=ml;}elseml++;}}arr[mm]=k;booll=sorted(arr,head->left,mm-1);boolr=sorted(arr,mm+1,head->right);if(!l&&r){//leftchildsequenceisn'tsorted,thenchangethetophead->right=mm-1;}elseif(l&&!r){//rightchildsequenceisn'tsorted,thenchangethetophead->left=mm+1;}elseif(!l&&!r){//bothsequencesaren'tsorted,thenchangethetopone//tothelongersequence,pushtheshorteronetothestackp=newqstack;if(mm-head->left>head->right-mm){p->left=mm+1;p->right=head->right;head->right=mm-1;}else{p->left=head->left;p->right=mm-1;head->left=mm+1;}p->next=head;head=p;}else{//bothsequencesaresorted,thenpophead=head->next;}}}}intmain( ){intarray[MAX_SEQ];intn;while(cout<<"inputthelengthofthesequence:",cin>>n){cout<<"input"<<n<<"numbers\n";for(inti=0;i<n;i++)cin>>array[i];qsort(array,0,n-1);cout<<"afterquicksorted:\n";for(inti=0;i<n;i++)cout<