鏁版嵁緇撴瀯絎簲绔犵畻娉曡璁￠[16]_璺ㄨ€冪綉

聽聽聽聽聽聽聽 1. 璁?/span>A[1..100]鏄竴涓褰曟瀯鎴愮殑鏁扮粍錛?/span>B[1..100]鏄竴涓暣鏁版暟緇勶紝鍏跺€間粙浜?/span>1鑷?/span>100涔嬮棿錛岀幇瑕佹眰鎸?/span>B[1..100]鐨勫唴瀹硅皟鏁?/span>A涓褰曠殑嬈″簭錛屾瘮濡傚綋B[1]=ll鏃訛紝鍒欒姹傚皢A[1]鐨勫唴瀹硅皟鏁村埌A[11]涓幓銆傝瀹氬彲浣跨敤鐨勯檮鍔犵┖闂翠負O(1)銆傘€愪腑縐戦櫌璁＄畻鎵€ 2000 涓冿紙15鍒嗭級銆?/span>

銆€銆€銆愬弬鑰冪瓟妗堛€?/span>

銆€銆€[棰樼洰鍒嗘瀽]棰樼洰瑕佹眰鎸?/span>B鏁扮粍鍐呭璋冩暣A鏁扮粍涓褰曠殑嬈″簭錛屽彲浠ヤ粠i=1寮€濮嬶紝媯€鏌ユ槸鍚?/span>B[i]=i銆傚鏄紝鍒?/span>A[i]鎭頒負姝ｇ‘浣嶇疆錛屼笉闇€鍐嶈皟錛涘惁鍒欙紝B[i]=k鈮?/span>i錛屽垯灝?/span>A[i]鍜?/span>A[k]瀵硅皟錛?/span>B[i]鍜?/span>B[k]瀵硅皟錛岀洿鍒?/span>B[i]=i涓烘銆?/span>

銆€銆€void CountSort (rectype A[],int B[])

銆€銆€//A鏄?/span>100涓褰曠殑鏁扮粍錛?/span>B鏄暣鍨嬫暟緇勶紝鏈畻娉曞埄鐢ㄦ暟緇?/span>B瀵?/span>A榪涜璁℃暟鎺掑簭

銆€銆€{int i,j,n=100;

銆€銆€i=1;

銆€銆€while(i<n)

銆€銆€{if(B[i]!=i) //鑻?/span>B[i]=i鍒?/span>A[i]姝ｅソ鍦ㄨ嚜宸辯殑浣嶇疆涓婏紝鍒欎笉闇€瑕佽皟鏁?/span>

銆€銆€{ j=i;

銆€銆€while (B[j]!=i)

銆€銆€{ k=B[j]; B[j]=B[k]; B[k]=k; // B[j]鍜?/span>B[k]浜ゆ崲

銆€銆€r0=A[j];A[j]=A[k]; A[k]=r0; } //r0鏄暟緇?/span>A鐨勫厓绱犵被鍨?/span>,A[j]鍜?/span>A[k]浜ゆ崲

銆€銆€i++;} //瀹屾垚浜嗕竴涓皬寰幆錛岀i涓凡緇忓畨鎺掑ソ

銆€銆€}//綆楁硶緇撴潫