八大排序(C語言) 八大排序(C語言)

原創

八大排序(C語言)

2019-10-08 19:43:57 Sunshinebaekhyun 閱讀數 1139更多

分類專欄： 八大排序

void BubbleSort();//冒泡

void SelectSort();//選擇

void InsertSort();//直接插入

void ShellSort();//希爾

void HeapSort();//堆排

void QuickSort();//快排

void MegerSort();//歸併

void RadixSort();//基數(桶排序)

冒泡：
1）比較相鄰的元素。如果第一個比第二個大，就交換他們兩個；
2）對每一對相鄰元素作同樣的工作，從開始第一對到結尾的最後一對。這步做完後，最後的元素會是最大的數；
3）針對所有的元素重複以上的步驟，除了最後一個；
4）持續每次對越來越少的元素重複上面的步驟，直到沒有任何一對數字需要比較。
選擇：
1）首先在未排序序列中找到最小（大）元素，存放到排序序列的起始位置；
2）再從剩餘未排序元素中繼續尋找最小（大）元素，然後放到已排序序列的末尾；
3）重複第二步，直到所有元素均排序完畢。
直接插入：
插入排序是一種最簡單直觀的排序算法，它的工作原理是通過構建有序序列，對於未排序數據，在已排序序列中從後向前掃描，找到相應位置並插入。

算法步驟：
1）將第一待排序序列第一個元素看做一個有序序列，把第二個元素到最後一個元素當成是未排序序列；
2）從頭到尾依次掃描未排序序列，將掃描到的每個元素插入有序序列的適當位置(相同則插入相等元素後邊)。
希爾(遞減增量排序算法)：
核心思想：先將整個待排序的記錄序列分割成爲若干子序列分別進行直接插入排序，待整個序列中的記錄“基本有序”時，再對全體記錄進行依次直接插入排序。
1）選擇一個增量序列d[1]，t[2]，…，d[k]，其中d[i]>d[j]，d[k]=1；
2）按增量序列個數k，對序列進行k 趟排序；
3）每趟排序，根據對應的增量ti，將待排序列分割成若干長度爲m 的子序列，分別對各子表進行直接插入排序。僅增量因子爲1 時，整個序列作爲一個表來處理，表長度即爲整個序列的長度。
堆排：



快排：

歸併：

基數排序：
基數排序是一種非比較型整數排序算法，其原理是將整數按位數切割成不同的數字，然後按每個位數分別比較。

1.算法排序的時間複雜度:
時間複雜度o(n^2)
冒泡排序，選擇排序，插入排序
時間複雜度o(n*logn)
歸併排序，快速排序，堆排序，希爾排序
時間複雜度o(n)
基數排序

2.算法排序的空間複雜度
o(1)
冒泡排序，選擇排序，插入排序，堆排序，希爾排序
o(nlogn)
快速排序
o(N)
歸併排序
o(M)
基數排序

3.穩定性：相同值的元素排序前和排序後值保持不變
穩定的排序算法：冒泡排序，插入排序，歸併排序，基數排序；
不穩定的排序算法：選擇排序，快速排序，堆排序，希爾排序；
4.不穩定原因：
選擇排序原因：在選擇最小值和位置爲0的數交換的時候產生；
快速排序原因：在隨機選擇相同值中間的數的，兩邊的相同值的不不是被劃分到選擇值得左邊就是選擇值的右邊；
堆排序原因：在每次建立大根堆後，堆頂元素會換到最後的位置上去；
希爾排序：步長爲2時，第二個1跳兩部，造成了不穩定；

詳情見代碼註釋

/***********************************************************

Create date:2019.10.8
Designer by:MaL
Compiling environment:Microsoft Visual Studio2012

************************************************************/

#include “sort.h”
#include <assert.h>
#include <string.h>
#include <malloc.h>
#include <stdio.h>
#include <math.h>

void Swap(int a, int b)
{
int c = a;
a = b;
b = c;
}

void Show(int *arr, int len)
{
for (int i = 0; i < len; ++i)
{
printf("%d ", arr[i]);
}

<span class="token function">printf</span><span class="token punctuation">(</span><span class="token string">"\n"</span><span class="token punctuation">)</span><span class="token punctuation">;</span>

}

// 冒泡
// O(n^2) O(1) 穩定
void BubbleSort(int *arr, int len)
{
for (int i = 0; i < len - 1; ++i)
{
int flag = 0;
for (int j = 0; j < len - 1 - i; ++j)
{
if (arr[j] > arr[j + 1])
{
Swap(&arr[j], &arr[j + 1]);
flag = 1;
}
}

	<span class="token keyword">if</span> <span class="token punctuation">(</span>flag <span class="token operator">==</span> <span class="token number">0</span><span class="token punctuation">)</span>
	<span class="token punctuation">{</span>
		<span class="token keyword">break</span><span class="token punctuation">;</span>
	<span class="token punctuation">}</span>
<span class="token punctuation">}</span>

}

// 選擇
// O(n^2) O(1) 不穩定
void SelectSort(int *arr, int len)
{
for (int i = 0; i < len - 1; ++i)
{
int min = i;
for (int j = i + 1; j < len; ++j)
{
if (arr[j] < arr[min])
{
min = j;
}
}

	<span class="token function">Swap</span><span class="token punctuation">(</span><span class="token operator">&amp;</span>arr<span class="token punctuation">[</span>i<span class="token punctuation">]</span><span class="token punctuation">,</span> <span class="token operator">&amp;</span>arr<span class="token punctuation">[</span>min<span class="token punctuation">]</span><span class="token punctuation">)</span><span class="token punctuation">;</span>
<span class="token punctuation">}</span>

}

//直接插入排序 數據越趨於有序，其效率越高
// O(n^2) O(1) 穩定
// 最壞 O(n^2) 最好 O(n)
void InsertSort(int *arr, int len)
{
for (int i = 1; i < len; ++i)
{
int tmp = arr[i];
int j = 0;
for (j = i - 1; j >= 0; –j)
{
if (arr[j] > tmp)
{
arr[j + 1] = arr[j];
}
else
{
break;
}
}

	arr<span class="token punctuation">[</span>j <span class="token operator">+</span> <span class="token number">1</span><span class="token punctuation">]</span> <span class="token operator">=</span> tmp<span class="token punctuation">;</span>
<span class="token punctuation">}</span>

}

static void Shell2(int *arr, int len, int d)
{
for (int k = 0; k < d; ++k)
{
for (int i = d + k; i < len; i += d)
{
int tmp = arr[i];
int j = i - d;
for (; j >= 0; j -= d)
{
if (arr[j] > tmp)
{
arr[j + d] = arr[j];
}
else
{
break;
}
}

		arr<span class="token punctuation">[</span>j <span class="token operator">+</span> d<span class="token punctuation">]</span> <span class="token operator">=</span> tmp<span class="token punctuation">;</span>
	<span class="token punctuation">}</span>
<span class="token punctuation">}</span>

}
static void Shell(int *arr, int len, int d)
{
for (int i = d; i < len; ++i)
{
int tmp = arr[i];
int j = i - d;
for (; j >= 0; j -= d)
{
if (arr[j] > tmp)
{
arr[j + d] = arr[j];
}
else
{
break;
}
}

	arr<span class="token punctuation">[</span>j <span class="token operator">+</span> d<span class="token punctuation">]</span> <span class="token operator">=</span> tmp<span class="token punctuation">;</span>
<span class="token punctuation">}</span>

}

//希爾排序
// O(n ^1.3~1.5) O(1) 不穩定
void ShellSort(int *arr, int len)
{
// 目前並沒有一個合適的固定分組
// 分組的值需要兩兩互質，並且最後一個分組必須爲1
int d[] = { 5, 3, 1 };
for (int i = 0; i < sizeof(d) / sizeof(d[0]); ++i)
{
Shell(arr, len, d[i]);
}
}

// O(logn)
static void OneAdjust(int arr, int len, int root)
{
int i = root;
int tmp = arr[i];
int j = 2 i + 1; // left
while (j < len)
{
if (j + 1 < len && arr[j] < arr[j + 1])
{
j = j + 1;
}
// j 就是左右孩子中較大的哪一個
if (arr[j] > tmp)
{
arr[i] = arr[j];
i = j; // 下一個子樹的根
j = 2 * i + 1; // 下一個子樹的左孩子
}
else
{
break;
}
}

arr<span class="token punctuation">[</span>i<span class="token punctuation">]</span> <span class="token operator">=</span> tmp<span class="token punctuation">;</span>

}

// O(nlogn)
static void CreateHeap(int *arr, int len)
{
int root = len / 2 - 1;
for (; root >= 0; –root)
{
OneAdjust(arr, len, root); // O(logn)
}
}

//堆排序
// O(nlogn) O(1) 不穩定
void HeapSort(int *arr, int len)
{
CreateHeap(arr, len); // O(nlogn)

<span class="token keyword">for</span> <span class="token punctuation">(</span><span class="token keyword">int</span> i <span class="token operator">=</span> <span class="token number">0</span><span class="token punctuation">;</span> i <span class="token operator">&lt;</span> len <span class="token operator">-</span> <span class="token number">1</span><span class="token punctuation">;</span> <span class="token operator">++</span>i<span class="token punctuation">)</span>  <span class="token comment">// O(n)</span>
<span class="token punctuation">{</span>
	<span class="token function">Swap</span><span class="token punctuation">(</span><span class="token operator">&amp;</span>arr<span class="token punctuation">[</span><span class="token number">0</span><span class="token punctuation">]</span><span class="token punctuation">,</span> <span class="token operator">&amp;</span>arr<span class="token punctuation">[</span>len <span class="token operator">-</span> <span class="token number">1</span> <span class="token operator">-</span> i<span class="token punctuation">]</span><span class="token punctuation">)</span><span class="token punctuation">;</span>

	<span class="token function">OneAdjust</span><span class="token punctuation">(</span>arr<span class="token punctuation">,</span> len <span class="token operator">-</span> i <span class="token operator">-</span> <span class="token number">1</span><span class="token punctuation">,</span> <span class="token number">0</span><span class="token punctuation">)</span><span class="token punctuation">;</span>  <span class="token comment">//  O(logn)</span>
<span class="token punctuation">}</span>

}

// O(n)
static int OneQuick(int *arr, int i, int j)
{
int tmp = arr[i];

<span class="token keyword">while</span> <span class="token punctuation">(</span>i <span class="token operator">&lt;</span> j<span class="token punctuation">)</span>   <span class="token comment">//   保證找的整個過程  i  &lt; j</span>
<span class="token punctuation">{</span>
	<span class="token keyword">while</span> <span class="token punctuation">(</span>i <span class="token operator">&lt;</span> j<span class="token punctuation">)</span>   <span class="token comment">//  從後向前找比tmp小的元素  保證  i &lt; j</span>
	<span class="token punctuation">{</span>
		<span class="token keyword">if</span> <span class="token punctuation">(</span>arr<span class="token punctuation">[</span>j<span class="token punctuation">]</span> <span class="token operator">&lt;</span> tmp<span class="token punctuation">)</span> <span class="token keyword">break</span><span class="token punctuation">;</span>
		j<span class="token operator">--</span><span class="token punctuation">;</span>
	<span class="token punctuation">}</span>

	arr<span class="token punctuation">[</span>i<span class="token punctuation">]</span> <span class="token operator">=</span> arr<span class="token punctuation">[</span>j<span class="token punctuation">]</span><span class="token punctuation">;</span>   <span class="token comment">//   當找到比tmp小的元素後，將j位置的值存儲到i位置</span>

	<span class="token keyword">while</span> <span class="token punctuation">(</span>i <span class="token operator">&lt;</span> j<span class="token punctuation">)</span>  <span class="token comment">//  從前向後找比tmp大的元素  保證  i &lt; j</span>
	<span class="token punctuation">{</span>
		<span class="token keyword">if</span> <span class="token punctuation">(</span>arr<span class="token punctuation">[</span>i<span class="token punctuation">]</span> <span class="token operator">&gt;</span> tmp<span class="token punctuation">)</span> <span class="token keyword">break</span><span class="token punctuation">;</span>
		i<span class="token operator">++</span><span class="token punctuation">;</span>
	<span class="token punctuation">}</span>

	arr<span class="token punctuation">[</span>j<span class="token punctuation">]</span> <span class="token operator">=</span> arr<span class="token punctuation">[</span>i<span class="token punctuation">]</span><span class="token punctuation">;</span>  <span class="token comment">//   當找到比tmp大的元素後，將i位置的值存儲到j位置</span>
<span class="token punctuation">}</span>

arr<span class="token punctuation">[</span>i<span class="token punctuation">]</span> <span class="token operator">=</span> tmp<span class="token punctuation">;</span>   <span class="token comment">//   i之前的數據都比tmp小， 之後的數據都比tmp大</span>

<span class="token keyword">return</span> i<span class="token punctuation">;</span>

}

// O(nlogn) O(logn) 不穩定
static void Quick(int *arr, int left, int right)
{
// O(n)
int mod = OneQuick(arr, left, right);

<span class="token keyword">if</span> <span class="token punctuation">(</span>mod <span class="token operator">-</span> left <span class="token operator">&gt;</span> <span class="token number">1</span><span class="token punctuation">)</span>   <span class="token comment">//  i左邊剩餘的數據是否超過1個</span>
<span class="token punctuation">{</span>
	<span class="token function">Quick</span><span class="token punctuation">(</span>arr<span class="token punctuation">,</span> left<span class="token punctuation">,</span> mod <span class="token operator">-</span> <span class="token number">1</span><span class="token punctuation">)</span><span class="token punctuation">;</span>
<span class="token punctuation">}</span>
<span class="token keyword">if</span> <span class="token punctuation">(</span>right <span class="token operator">-</span> mod <span class="token operator">&gt;</span> <span class="token number">1</span><span class="token punctuation">)</span>  <span class="token comment">// i右邊剩餘的數據是否超過1個</span>
<span class="token punctuation">{</span>
	<span class="token function">Quick</span><span class="token punctuation">(</span>arr<span class="token punctuation">,</span> mod <span class="token operator">+</span> <span class="token number">1</span><span class="token punctuation">,</span> right<span class="token punctuation">)</span><span class="token punctuation">;</span>
<span class="token punctuation">}</span>

}

//
static void ForQuick(int arr, int left, int right)
{
Stack st;
int size = (int)(log10((double)(right - left + 1)) / log10((double)2));
size = (size + 1) sizeof(int) 2;
st.data = (int )malloc(size);
assert(st.data != NULL);
st.top = 0;

st<span class="token punctuation">.</span>data<span class="token punctuation">[</span>st<span class="token punctuation">.</span>top<span class="token operator">++</span><span class="token punctuation">]</span> <span class="token operator">=</span> left<span class="token punctuation">;</span>
st<span class="token punctuation">.</span>data<span class="token punctuation">[</span>st<span class="token punctuation">.</span>top<span class="token operator">++</span><span class="token punctuation">]</span> <span class="token operator">=</span> right<span class="token punctuation">;</span>

<span class="token keyword">while</span> <span class="token punctuation">(</span>st<span class="token punctuation">.</span>top <span class="token operator">!=</span> <span class="token number">0</span><span class="token punctuation">)</span>
<span class="token punctuation">{</span>
	right <span class="token operator">=</span> st<span class="token punctuation">.</span>data<span class="token punctuation">[</span><span class="token operator">--</span>st<span class="token punctuation">.</span>top<span class="token punctuation">]</span><span class="token punctuation">;</span>
	left <span class="token operator">=</span> st<span class="token punctuation">.</span>data<span class="token punctuation">[</span><span class="token operator">--</span>st<span class="token punctuation">.</span>top<span class="token punctuation">]</span><span class="token punctuation">;</span>

	<span class="token keyword">int</span> mod <span class="token operator">=</span> <span class="token function">OneQuick</span><span class="token punctuation">(</span>arr<span class="token punctuation">,</span> left<span class="token punctuation">,</span> right<span class="token punctuation">)</span><span class="token punctuation">;</span>

	<span class="token keyword">if</span> <span class="token punctuation">(</span>mod <span class="token operator">-</span> left <span class="token operator">&gt;</span> <span class="token number">1</span><span class="token punctuation">)</span>
	<span class="token punctuation">{</span>
		st<span class="token punctuation">.</span>data<span class="token punctuation">[</span>st<span class="token punctuation">.</span>top<span class="token operator">++</span><span class="token punctuation">]</span> <span class="token operator">=</span> left<span class="token punctuation">;</span>
		st<span class="token punctuation">.</span>data<span class="token punctuation">[</span>st<span class="token punctuation">.</span>top<span class="token operator">++</span><span class="token punctuation">]</span> <span class="token operator">=</span> mod <span class="token operator">-</span> <span class="token number">1</span><span class="token punctuation">;</span>
	<span class="token punctuation">}</span>
	<span class="token keyword">if</span> <span class="token punctuation">(</span>right <span class="token operator">-</span> mod <span class="token operator">&gt;</span> <span class="token number">1</span><span class="token punctuation">)</span>
	<span class="token punctuation">{</span>
		st<span class="token punctuation">.</span>data<span class="token punctuation">[</span>st<span class="token punctuation">.</span>top<span class="token operator">++</span><span class="token punctuation">]</span> <span class="token operator">=</span> mod <span class="token operator">+</span> <span class="token number">1</span><span class="token punctuation">;</span>
		st<span class="token punctuation">.</span>data<span class="token punctuation">[</span>st<span class="token punctuation">.</span>top<span class="token operator">++</span><span class="token punctuation">]</span> <span class="token operator">=</span> right<span class="token punctuation">;</span>
	<span class="token punctuation">}</span>
<span class="token punctuation">}</span>

<span class="token function">free</span><span class="token punctuation">(</span>st<span class="token punctuation">.</span>data<span class="token punctuation">)</span><span class="token punctuation">;</span>

}

//快速排序
void QuickSort(int *arr, int len)
{
ForQuick(arr, 0, len - 1);
}

// O(n)
static void Meger(int arr, int len, int width, int brr)
{
int L1 = 0;
int H1 = L1 + width - 1;
int L2 = H1 + 1;
int H2 = L2 + width - 1 < len - 1 ? L2 + width - 1 : len - 1;
int num = 0;

<span class="token keyword">while</span> <span class="token punctuation">(</span>L1 <span class="token operator">&lt;</span> len <span class="token operator">&amp;&amp;</span> L2 <span class="token operator">&lt;</span> len<span class="token punctuation">)</span>
<span class="token punctuation">{</span>
	<span class="token keyword">while</span> <span class="token punctuation">(</span>L1 <span class="token operator">&lt;=</span> H1 <span class="token operator">&amp;&amp;</span> L2 <span class="token operator">&lt;=</span> H2<span class="token punctuation">)</span>
	<span class="token punctuation">{</span>
		<span class="token keyword">if</span> <span class="token punctuation">(</span>arr<span class="token punctuation">[</span>L1<span class="token punctuation">]</span> <span class="token operator">&lt;</span> arr<span class="token punctuation">[</span>L2<span class="token punctuation">]</span><span class="token punctuation">)</span>
		<span class="token punctuation">{</span>
			brr<span class="token punctuation">[</span>num<span class="token operator">++</span><span class="token punctuation">]</span> <span class="token operator">=</span> arr<span class="token punctuation">[</span>L1<span class="token operator">++</span><span class="token punctuation">]</span><span class="token punctuation">;</span>
		<span class="token punctuation">}</span>
		<span class="token keyword">else</span>
		<span class="token punctuation">{</span>
			brr<span class="token punctuation">[</span>num<span class="token operator">++</span><span class="token punctuation">]</span> <span class="token operator">=</span> arr<span class="token punctuation">[</span>L2<span class="token operator">++</span><span class="token punctuation">]</span><span class="token punctuation">;</span>
		<span class="token punctuation">}</span>
	<span class="token punctuation">}</span>

	<span class="token keyword">while</span> <span class="token punctuation">(</span>L1 <span class="token operator">&lt;=</span> H1<span class="token punctuation">)</span>
	<span class="token punctuation">{</span>
		brr<span class="token punctuation">[</span>num<span class="token operator">++</span><span class="token punctuation">]</span> <span class="token operator">=</span> arr<span class="token punctuation">[</span>L1<span class="token operator">++</span><span class="token punctuation">]</span><span class="token punctuation">;</span>
	<span class="token punctuation">}</span>

	<span class="token keyword">while</span> <span class="token punctuation">(</span>L2 <span class="token operator">&lt;=</span> H2<span class="token punctuation">)</span>
	<span class="token punctuation">{</span>
		brr<span class="token punctuation">[</span>num<span class="token operator">++</span><span class="token punctuation">]</span> <span class="token operator">=</span> arr<span class="token punctuation">[</span>L2<span class="token operator">++</span><span class="token punctuation">]</span><span class="token punctuation">;</span>
	<span class="token punctuation">}</span>

	L1 <span class="token operator">=</span> H2 <span class="token operator">+</span> <span class="token number">1</span><span class="token punctuation">;</span>
	H1 <span class="token operator">=</span> L1 <span class="token operator">+</span> width <span class="token operator">-</span> <span class="token number">1</span> <span class="token operator">&lt;</span> len <span class="token operator">-</span> <span class="token number">1</span> <span class="token operator">?</span> L1 <span class="token operator">+</span> width <span class="token operator">-</span> <span class="token number">1</span> <span class="token punctuation">:</span> len <span class="token operator">-</span> <span class="token number">1</span><span class="token punctuation">;</span>
	L2 <span class="token operator">=</span> H1 <span class="token operator">+</span> <span class="token number">1</span><span class="token punctuation">;</span>
	H2 <span class="token operator">=</span> L2 <span class="token operator">+</span> width <span class="token operator">-</span> <span class="token number">1</span> <span class="token operator">&lt;</span> len <span class="token operator">-</span> <span class="token number">1</span> <span class="token operator">?</span> L2 <span class="token operator">+</span> width <span class="token operator">-</span> <span class="token number">1</span> <span class="token punctuation">:</span> len <span class="token operator">-</span> <span class="token number">1</span><span class="token punctuation">;</span>
<span class="token punctuation">}</span>

<span class="token keyword">while</span> <span class="token punctuation">(</span>L1 <span class="token operator">&lt;=</span> H1<span class="token punctuation">)</span>
<span class="token punctuation">{</span>
	brr<span class="token punctuation">[</span>num<span class="token operator">++</span><span class="token punctuation">]</span> <span class="token operator">=</span> arr<span class="token punctuation">[</span>L1<span class="token operator">++</span><span class="token punctuation">]</span><span class="token punctuation">;</span>
<span class="token punctuation">}</span>

<span class="token keyword">for</span> <span class="token punctuation">(</span><span class="token keyword">int</span> i <span class="token operator">=</span> <span class="token number">0</span><span class="token punctuation">;</span> i <span class="token operator">&lt;</span> len<span class="token punctuation">;</span> <span class="token operator">++</span>i<span class="token punctuation">)</span>
<span class="token punctuation">{</span>
	arr<span class="token punctuation">[</span>i<span class="token punctuation">]</span> <span class="token operator">=</span> brr<span class="token punctuation">[</span>i<span class="token punctuation">]</span><span class="token punctuation">;</span>
<span class="token punctuation">}</span>

}

//歸併排序
// O(nlogn) O(n) 穩定
void MegerSort(int arr, int len)
{
int brr = (int )malloc(sizeof(int) len);

<span class="token keyword">for</span> <span class="token punctuation">(</span><span class="token keyword">int</span> i <span class="token operator">=</span> <span class="token number">1</span><span class="token punctuation">;</span> i <span class="token operator">&lt;</span> len<span class="token punctuation">;</span> i <span class="token operator">*</span><span class="token operator">=</span> <span class="token number">2</span><span class="token punctuation">)</span>
<span class="token punctuation">{</span>
	<span class="token function">Meger</span><span class="token punctuation">(</span>arr<span class="token punctuation">,</span> len<span class="token punctuation">,</span> i<span class="token punctuation">,</span> brr<span class="token punctuation">)</span><span class="token punctuation">;</span>   <span class="token comment">// O(n)</span>
<span class="token punctuation">}</span>

<span class="token function">free</span><span class="token punctuation">(</span>brr<span class="token punctuation">)</span><span class="token punctuation">;</span>

}

// 求數組中最大數字的寬度
static int GetMaxWidth(int *arr, int len)
{
int max = arr[0];
for (int i = 0; i < len; ++i)
{
if (arr[i] > max) max = arr[i];
}

<span class="token keyword">int</span> width <span class="token operator">=</span> <span class="token number">0</span><span class="token punctuation">;</span>
<span class="token keyword">while</span> <span class="token punctuation">(</span>max<span class="token punctuation">)</span>  <span class="token comment">//  12</span>
<span class="token punctuation">{</span>
	width<span class="token operator">++</span><span class="token punctuation">;</span>
	max <span class="token operator">/</span><span class="token operator">=</span> <span class="token number">10</span><span class="token punctuation">;</span>
<span class="token punctuation">}</span>

<span class="token keyword">return</span> width<span class="token punctuation">;</span>

}

// 求data的倒數第i+1位上的值
static int GetNumOfWidth(int data, int i)
{
while (i)
{
data /= 10;
i–;
}

<span class="token keyword">return</span> data <span class="token operator">%</span> <span class="token number">10</span><span class="token punctuation">;</span>

}

// O(d * n) O(k + n) 穩定
// 基數排序 不需要比較的排序
void RadixSort(int arr, int len)
{
/
1、創建隊列
2、先求最大數字的位數
3、求出相應位數的值， 並根據位數值將其存儲相應的隊列中
4、按順序輸出所有隊列中的值， 循環處理3,4步，循環次數由第一步算出
*/

Que que<span class="token punctuation">[</span><span class="token number">10</span><span class="token punctuation">]</span><span class="token punctuation">;</span>
<span class="token keyword">for</span> <span class="token punctuation">(</span><span class="token keyword">int</span> i <span class="token operator">=</span> <span class="token number">0</span><span class="token punctuation">;</span> i <span class="token operator">&lt;</span> <span class="token number">10</span><span class="token punctuation">;</span> <span class="token operator">++</span>i<span class="token punctuation">)</span>
<span class="token punctuation">{</span>
	que<span class="token punctuation">[</span>i<span class="token punctuation">]</span><span class="token punctuation">.</span>data <span class="token operator">=</span> <span class="token punctuation">(</span><span class="token keyword">int</span><span class="token operator">*</span><span class="token punctuation">)</span><span class="token function">malloc</span><span class="token punctuation">(</span><span class="token keyword">sizeof</span><span class="token punctuation">(</span><span class="token keyword">int</span><span class="token punctuation">)</span><span class="token operator">*</span> len<span class="token punctuation">)</span><span class="token punctuation">;</span>
	<span class="token function">assert</span><span class="token punctuation">(</span>que<span class="token punctuation">[</span>i<span class="token punctuation">]</span><span class="token punctuation">.</span>data <span class="token operator">!=</span> <span class="token constant">NULL</span><span class="token punctuation">)</span><span class="token punctuation">;</span>
	que<span class="token punctuation">[</span>i<span class="token punctuation">]</span><span class="token punctuation">.</span>head <span class="token operator">=</span> que<span class="token punctuation">[</span>i<span class="token punctuation">]</span><span class="token punctuation">.</span>tail <span class="token operator">=</span> <span class="token number">0</span><span class="token punctuation">;</span>
<span class="token punctuation">}</span>

<span class="token keyword">int</span> width <span class="token operator">=</span> <span class="token function">GetMaxWidth</span><span class="token punctuation">(</span>arr<span class="token punctuation">,</span> len<span class="token punctuation">)</span><span class="token punctuation">;</span> <span class="token comment">// O(n)</span>

<span class="token keyword">for</span> <span class="token punctuation">(</span><span class="token keyword">int</span> i <span class="token operator">=</span> <span class="token number">0</span><span class="token punctuation">;</span> i <span class="token operator">&lt;</span> width<span class="token punctuation">;</span> <span class="token operator">++</span>i<span class="token punctuation">)</span>  <span class="token comment">// O(d * n)</span>
<span class="token punctuation">{</span>
	<span class="token comment">//  將數組中所有的數字取其相應位數的值，並將其存儲到相應的隊列中</span>
	<span class="token keyword">for</span> <span class="token punctuation">(</span><span class="token keyword">int</span> j <span class="token operator">=</span> <span class="token number">0</span><span class="token punctuation">;</span> j <span class="token operator">&lt;</span> len<span class="token punctuation">;</span> <span class="token operator">++</span>j<span class="token punctuation">)</span>
	<span class="token punctuation">{</span>
		<span class="token keyword">int</span>  num <span class="token operator">=</span> <span class="token function">GetNumOfWidth</span><span class="token punctuation">(</span>arr<span class="token punctuation">[</span>j<span class="token punctuation">]</span><span class="token punctuation">,</span> i<span class="token punctuation">)</span><span class="token punctuation">;</span>
		que<span class="token punctuation">[</span>num<span class="token punctuation">]</span><span class="token punctuation">.</span>data<span class="token punctuation">[</span>que<span class="token punctuation">[</span>num<span class="token punctuation">]</span><span class="token punctuation">.</span>tail<span class="token operator">++</span><span class="token punctuation">]</span> <span class="token operator">=</span> arr<span class="token punctuation">[</span>j<span class="token punctuation">]</span><span class="token punctuation">;</span>
	<span class="token punctuation">}</span>

	<span class="token keyword">int</span> k <span class="token operator">=</span> <span class="token number">0</span><span class="token punctuation">;</span>
	<span class="token keyword">for</span> <span class="token punctuation">(</span><span class="token keyword">int</span> m <span class="token operator">=</span> <span class="token number">0</span><span class="token punctuation">;</span> m <span class="token operator">&lt;</span> <span class="token number">10</span><span class="token punctuation">;</span> <span class="token operator">++</span>m<span class="token punctuation">)</span>
	<span class="token punctuation">{</span>
		<span class="token keyword">while</span> <span class="token punctuation">(</span>que<span class="token punctuation">[</span>m<span class="token punctuation">]</span><span class="token punctuation">.</span>head <span class="token operator">!=</span> que<span class="token punctuation">[</span>m<span class="token punctuation">]</span><span class="token punctuation">.</span>tail<span class="token punctuation">)</span>
		<span class="token punctuation">{</span>
			arr<span class="token punctuation">[</span>k<span class="token operator">++</span><span class="token punctuation">]</span> <span class="token operator">=</span> que<span class="token punctuation">[</span>m<span class="token punctuation">]</span><span class="token punctuation">.</span>data<span class="token punctuation">[</span>que<span class="token punctuation">[</span>m<span class="token punctuation">]</span><span class="token punctuation">.</span>head<span class="token operator">++</span><span class="token punctuation">]</span><span class="token punctuation">;</span>
		<span class="token punctuation">}</span>
	<span class="token punctuation">}</span>

	<span class="token keyword">for</span> <span class="token punctuation">(</span><span class="token keyword">int</span> n <span class="token operator">=</span> <span class="token number">0</span><span class="token punctuation">;</span> n <span class="token operator">&lt;</span> <span class="token number">10</span><span class="token punctuation">;</span> <span class="token operator">++</span>n<span class="token punctuation">)</span>
	<span class="token punctuation">{</span>
		que<span class="token punctuation">[</span>n<span class="token punctuation">]</span><span class="token punctuation">.</span>head <span class="token operator">=</span> que<span class="token punctuation">[</span>n<span class="token punctuation">]</span><span class="token punctuation">.</span>tail <span class="token operator">=</span> <span class="token number">0</span><span class="token punctuation">;</span>
	<span class="token punctuation">}</span>
<span class="token punctuation">}</span>

<span class="token keyword">for</span> <span class="token punctuation">(</span><span class="token keyword">int</span> i <span class="token operator">=</span> <span class="token number">0</span><span class="token punctuation">;</span> i <span class="token operator">&lt;</span> <span class="token number">10</span><span class="token punctuation">;</span> <span class="token operator">++</span>i<span class="token punctuation">)</span>
<span class="token punctuation">{</span>
	<span class="token function">free</span><span class="token punctuation">(</span>que<span class="token punctuation">[</span>i<span class="token punctuation">]</span><span class="token punctuation">.</span>data<span class="token punctuation">)</span><span class="token punctuation">;</span>
<span class="token punctuation">}</span>

}

• 1
• 2
• 3
• 4
• 5
• 6
• 7
• 8
• 9
• 10
• 11
• 12
• 13
• 14
• 15
• 16
• 17
• 18
• 19
• 20
• 21
• 22
• 23
• 24
• 25
• 26
• 27
• 28
• 29
• 30
• 31
• 32
• 33
• 34
• 35
• 36
• 37
• 38
• 39
• 40
• 41
• 42
• 43
• 44
• 45
• 46
• 47
• 48
• 49
• 50
• 51
• 52
• 53
• 54
• 55
• 56
• 57
• 58
• 59
• 60
• 61
• 62
• 63
• 64
• 65
• 66
• 67
• 68
• 69
• 70
• 71
• 72
• 73
• 74
• 75
• 76
• 77
• 78
• 79
• 80
• 81
• 82
• 83
• 84
• 85
• 86
• 87
• 88
• 89
• 90
• 91
• 92
• 93
• 94
• 95
• 96
• 97
• 98
• 99
• 100
• 101
• 102
• 103
• 104
• 105
• 106
• 107
• 108
• 109
• 110
• 111
• 112
• 113
• 114
• 115
• 116
• 117
• 118
• 119
• 120
• 121
• 122
• 123
• 124
• 125
• 126
• 127
• 128
• 129
• 130
• 131
• 132
• 133
• 134
• 135
• 136
• 137
• 138
• 139
• 140
• 141
• 142
• 143
• 144
• 145
• 146
• 147
• 148
• 149
• 150
• 151
• 152
• 153
• 154
• 155
• 156
• 157
• 158
• 159
• 160
• 161
• 162
• 163
• 164
• 165
• 166
• 167
• 168
• 169
• 170
• 171
• 172
• 173
• 174
• 175
• 176
• 177
• 178
• 179
• 180
• 181
• 182
• 183
• 184
• 185
• 186
• 187
• 188
• 189
• 190
• 191
• 192
• 193
• 194
• 195
• 196
• 197
• 198
• 199
• 200
• 201
• 202
• 203
• 204
• 205
• 206
• 207
• 208
• 209
• 210
• 211
• 212
• 213
• 214
• 215
• 216
• 217
• 218
• 219
• 220
• 221
• 222
• 223
• 224
• 225
• 226
• 227
• 228
• 229
• 230
• 231
• 232
• 233
• 234
• 235
• 236
• 237
• 238
• 239
• 240
• 241
• 242
• 243
• 244
• 245
• 246
• 247
• 248
• 249
• 250
• 251
• 252
• 253
• 254
• 255
• 256
• 257
• 258
• 259
• 260
• 261
• 262
• 263
• 264
• 265
• 266
• 267
• 268
• 269
• 270
• 271
• 272
• 273
• 274
• 275
• 276
• 277
• 278
• 279
• 280
• 281
• 282
• 283
• 284
• 285
• 286
• 287
• 288
• 289
• 290
• 291
• 292
• 293
• 294
• 295
• 296
• 297
• 298
• 299
• 300
• 301
• 302
• 303
• 304
• 305
• 306
• 307
• 308
• 309
• 310
• 311
• 312
• 313
• 314
• 315
• 316
• 317
• 318
• 319
• 320
• 321
• 322
• 323
• 324
• 325
• 326
• 327
• 328
• 329
• 330
• 331
• 332
• 333
• 334
• 335
• 336
• 337
• 338
• 339
• 340
• 341
• 342
• 343
• 344
• 345
• 346
• 347
• 348
• 349
• 350
• 351
• 352
• 353
• 354
• 355
• 356
• 357
• 358
• 359
• 360
• 361
• 362
• 363
• 364
• 365
• 366
• 367
• 368
• 369
• 370
• 371
• 372
• 373
• 374
• 375
• 376
• 377
• 378
• 379
• 380
• 381
• 382
• 383
• 384
• 385
• 386
• 387
• 388
• 389
• 390
• 391
• 392
• 393
• 394
• 395
• 396
• 397
• 398
• 399
• 400
• 401
• 402
• 403
• 404
• 405
• 406
• 407
• 408
• 409
• 410
• 411
• 412
• 413
• 414
• 415
• 416
• 417
• 418
• 419
• 420
• 421
• 422
• 423
• 424
• 425
• 426
• 427
• 428
• 429
• 430
• 431
• 432
• 433
• 434
• 435
• 436
• 437
• 438
• 439
• 440
• 441

                                </div>
            <link href="https://csdnimg.cn/release/phoenix/mdeditor/markdown_views-e9f16cbbc2.css" rel="stylesheet">
                </div>
</article>
<div class="postTime"> 
    <div class="article-bar-bottom">
        <span class="time">
            文章最後發佈於: 2019-11-01 08:33:55            </span>
    </div>
</div>