c語言實現常用排序演算法
阿新 • • 發佈：2018-11-13
#include <stdio.h> #include <stdlib.h> #define arrLen(arr) sizeof(arr)/sizeof(arr[0]) void print(int arr[], int len) { int i = 0; for (i = 0; i < len; i++) { printf("%d ", arr[i]); } printf("\n"); } int partition(int arr[], int low, int high){ int key; key = arr[low]; while (low < high){ while (low < high && arr[high] >= key) high--; if (low < high) arr[low++] = arr[high]; while (low < high && arr[low] <= key) low++; if (low < high) arr[high--] = arr[low]; } arr[low] = key; return low; } //快速排序 void quick_sort(int arr[], int start, int end){ int pos; if (start < end){ pos = partition(arr, start, end); quick_sort(arr, start, pos - 1); quick_sort(arr, pos + 1, end); } return; } //氣泡排序 void bubble_sort(int arr[], int len) { for (int i = 0; i < len - 1; i++) { int isSorted = 1; for (int j = 0; j < len - i - 1; j++) { if (arr[j]> arr[j + 1]) { isSorted = 0; int temp = arr[j]; arr[j] = arr[j + 1]; arr[j + 1] = temp; } } //如果沒有發生交換，說明陣列已經排序好了 if (isSorted) { break; } } } //插入排序 void insert_sort(int arr[], int len) { for (int i = 0; i < len; i++) { int j = 0; while (arr[j] < arr[i] && j < i) { j++; } if (i != j) { int tmp = arr[i]; for (int k = i; k>j; k--) { arr[k] = arr[k - 1]; } arr[j] = tmp; } } } void merge(int arr[], int low, int mid, int high) { int i, k; int *tmp = (int*)malloc(sizeof(int)* (high - low + 1)); int left_low = low; int left_high = mid; int right_low = mid + 1; int right_high = high; for (k = 0; left_low <= left_high && right_low <= right_high; k++) { if (arr[left_low] <= arr[right_low]) { tmp[k] = arr[left_low++]; } else{ tmp[k] = arr[right_low++]; } } if (left_low <=left_high) { for (i = left_low; i <= left_high; i++) { tmp[k++] = arr[i]; } } if (right_low <= right_high) { for (i = right_low; i <= right_high; i++) { tmp[k++] = arr[i]; } } for (i = 0; i < high - low + 1; i++) { arr[low + i] = tmp[i]; } free(tmp); return; } //歸併排序 void merge_sort(int arr[], int left, int right) { int bp = 9; int mid = 0; if (left < right) { mid = (left + right) / 2; merge_sort(arr, left, mid); merge_sort(arr, mid+1, right); merge(arr, left, mid, right); int bp = 9; } return ; } //選擇排序 void select_sort(int arr[], int len) { for (int i = 0; i < len - 1; i++) { int mid_index = i; for (int j = i + 1; j < len; j++) { if (arr[j] < arr[mid_index]) { mid_index = j; } } if (i != mid_index) { int temp = arr[i]; arr[i] = arr[mid_index]; arr[mid_index] = temp; } } } //希爾排序 void shell_sort(int arr[], int len) { for (int step = len / 2; step > 0; step = step / 2) { for (int i = step; i < len; i++) { for (int j = i - step; j >= 0 && arr[j]> arr[j + step]; j = j - step) { int temp = arr[j]; arr[j] = arr[j + step]; arr[j + step] = temp; } } } } int binarySearch(int arr[], int n, int key) { int low = 0; int high = n - 1; while (low <= high) { int mid = (low + high) / 2; int mid_value = arr[mid]; if (mid_value < key) { low = mid + 1; } else if (mid_value>key) { high = mid - 1; } else{ return mid; } } return -1; } //c語言實現常用排序演算法 //http://c.biancheng.net/cpp/html/2741.html int main(void){ { int arr[] = { 32, 12, 7, 78, 23, 45, 3, 6, 9 }; int len = arrLen(arr); printf("==========quick_sort============\n"); print(arr, len); quick_sort(arr, 0, len - 1); print(arr, len); } { int arr[] = { 32, 12, 7, 78, 23, 45, 3, 6, 9 }; int len = arrLen(arr); printf("==========bubble_sort============\n"); print(arr, len); bubble_sort(arr, len); print(arr, len); } { int arr[] = { 32, 12, 7, 78, 23, 45, 3, 6, 9 }; int len = arrLen(arr); printf("==========insert_sort============\n"); print(arr, len); insert_sort(arr, len); print(arr, len); } { int arr[] = { 9,8,7,6,5,4,3,2,1,0 }; int len = arrLen(arr); printf("==========merge_sort============\n"); print(arr, len); merge_sort(arr,0, len-1); print(arr, len); } { int arr[] = { 9, 8, 7, 6, 5, 4, 3, 2, 1, 0 }; int len = arrLen(arr); printf("==========select_sort============\n"); print(arr, len); select_sort(arr, len); print(arr, len); } { int arr[] = { 9, 8, 7, 6, 5, 4, 3, 2, 1, 0 }; int len = arrLen(arr); printf("==========shell_sort============\n"); print(arr, len); shell_sort(arr, len); print(arr, len); } return 0; }
#include <stdio.h> #include <stdlib.h> #define arrLen(arr) sizeof(arr)/sizeof(arr[0]) void print(int arr[], int len) { int i = 0; for (i = 0; i < len; i++) { printf("%d ", arr[i]); } printf("\n"); } void swap(int* a, int* b) { int temp = *a; *a = *b; *b = temp; } int partition(int arr[],int low,int high) { int key = arr[low]; while (low < high) { while (low < high && arr[high] >= key) { high--; } if (low < high) { arr[low++] = arr[high]; } while (low < high && arr[low] <= key) { low++; } if (low < high) { arr[high--] = arr[low]; } } arr[low] = key; return low; } /** 快速排序 排序過程 選擇一個樞紐元，可以選擇首，尾，中三個數的中位數作為樞紐元； 將樞紐元的為止與陣列的尾地址進行交換； 定義兩個指標，P1指向陣列首地址，P2指向陣列倒數第二個位置，P1所指元素的值與樞紐元比較，如果小於樞紐元則後移一位，如果大於就停下來。P1所指元素的值與樞紐元比較，如果大於樞紐元則前移一位，如果小於就停下來； 交換P1和P2所指向的元素； 重複３和４直到P1大於P2； 對陣列的分割過程同樣採用遞迴的方法。 */ void quick_sort(int arr[], int start,int end) { int bp = 1; int pos; if (start < end) { pos = partition(arr, start, end); quick_sort(arr, start, pos-1); quick_sort(arr, pos+1, end); int bp = 1; } return; } //https://blog.csdn.net/liqinzhe11/article/details/78743743 int findmiddle(int a, int b, int c) { if (a >= b && a <= c) return a; else if (b >= a && b <= c) return b; else return c; } void quicksortHelper(int a[], int start, int end) { if (start >= end) return; int l = start; int r = end; int pivot = findmiddle(a[start], a[end], a[(end - start) / 2 + start]); while (l <= r) { while (l <= r && a[r] > pivot) r--; while (l <= r && a[l] < pivot) l++; if (l <= r) swap(&a[l++], &a[r--]); } quicksortHelper(a, start, r); quicksortHelper(a, l, end); } void quick_sort2(int a[],int len) { quicksortHelper(a, 0,len - 1); } //氣泡排序 void bubble_sort(int arr[], int len) { for (int i = 0; i < len - 1; i++) { int isSorted = 1; for (int j = 0; j < len - i - 1; j++) { if (arr[j]> arr[j + 1]) { isSorted = 0; int temp = arr[j]; arr[j] = arr[j + 1]; arr[j + 1] = temp; } } //如果沒有發生交換，說明陣列已經排序好了 if (isSorted) { break; } } } //插入排序 void insert_sort(int arr[], int len) { for (int i = 0; i < len; i++) { int j = 0; int tmp = arr[i]; while (arr[j] < arr[i] && j < i) { j++; } if (i != j) { for (int k = i; k>j; k--) { arr[k] = arr[k - 1]; } arr[j] = tmp; } } } void merge(int arr[], int low, int mid, int high) { int i, k; int *tmp = (int*)malloc(sizeof(int)* (high - low + 1)); int left_low = low; int left_high = mid; int right_low = mid + 1; int right_high = high; for (k = 0; left_low <= left_high && right_low <= right_high; k++) { if (arr[left_low] <= arr[right_low]) { tmp[k] = arr[left_low++]; } else{ tmp[k] = arr[right_low++]; } } if (left_low <=left_high) { for (i = left_low; i <= left_high; i++) { tmp[k++] = arr[i]; } } if (right_low <= right_high) { for (i = right_low; i <= right_high; i++) { tmp[k++] = arr[i]; } } for (i = 0; i < high - low + 1; i++) { arr[low + i] = tmp[i]; } free(tmp); return; } //歸併排序 //將陣列Ｎ從中間分成兩個陣列N1和N2,然後遞迴兩兩歸併。 void merge_sort(int arr[], int left, int right) { int bp = 9; int mid = 0; if (left < right) { mid = (left + right) / 2; merge_sort(arr, left, mid); merge_sort(arr, mid+1, right); merge(arr, left, mid, right); int bp = 9; } return ; } //選擇排序 //1、每一次從後面選擇出一個最小的值（swap_pos），替換到前面來(i)。 void select_sort(int arr[], int len) { for (int i = 0; i < len - 1; i++) { int mid_index = i; for (int j = i + 1; j < len; j++) { if (arr[j] < arr[mid_index]) { mid_index = j; } } if (i != mid_index) { int temp = arr[i]; arr[i] = arr[mid_index]; arr[mid_index] = temp; } } } //希爾排序 //希爾排序是在插入排序的基礎上進行發展的，通過一個希爾增量先排序一定間隔的資料。 //最壞情況複雜度:O(N^2) 不穩定排序 void shell_sort(int arr[], int len) { for (int step = len / 2; step > 0; step = step / 2) { for (int i = step; i < len; i++) { for (int j = i - step; j >= 0 && arr[j]> arr[j + step]; j = j - step) { int temp = arr[j]; arr[j] = arr[j + step]; arr[j + step] = temp; } } } } //堆排序 //建堆的平均時間是：O(N) //建堆的最壞情況是：O(NlogN) //刪除元素的時間是：O(logN) //整個排序平均時間複雜度：O(N+NlogN)=O(NlogN) //最壞情況複雜度：O(NlogN) //不穩定排序 //建立一個大頂堆O(n),要求就是 把最大的元素 移動到堆頂 也就是a[0] void make_heap(int a[], int len) //size的當前堆的大小，也就是陣列的前size個數 { for (int i = len - 1; i > 0; i--) { if (i % 2 && a[i] > a[(i - 1) / 2])//奇數 swap(&a[i], &a[(i - 1) / 2]); else if (i % 2 == 0 && a[i] > a[(i - 2) / 2])//偶數 swap(&a[i], &a[(i - 2) / 2]); } } void heap_sort(int a[],int len) { int n =len; while (n) { make_heap(a, n); //每次把新的最大元素移到堆頂，也就是a[0] n--; swap(&a[0], &a[n]); //然後把當前最大移動到後面來作為排好序的元素 } } int binarySearch(int arr[], int n, int key) { int low = 0; int high = n - 1; while (low <= high) { int mid = (low + high) / 2; int mid_value = arr[mid]; if (mid_value < key) { low = mid + 1; } else if (mid_value>key) { high = mid - 1; } else{ return mid; } } return -1; } int my_partition(int arr[], int low, int high) { int key = arr[low]; while (low < high) { while (low<high && arr[high] >= key) { high--; } if(low<high) arr[low++] = arr[high]; while (low < high && arr[high] <= key) { low++; } if(low<high) arr[high--] = arr[low]; } arr[low] = key; return low; } //快速排序的每一輪處理其實就是將這一輪的基準數歸位，直到所有的數都歸位為止，排序就結束了。 void my_qsort(int arr[], int low, int high) { if (low < high) { int pos = my_partition(arr, low, high); my_qsort(arr, 0, pos-1); my_qsort(arr, pos+1, high); } } //此時以基準數6為分界點，6左邊的數都小於等於6，6右邊的數都大於等於6。 //回顧一下剛才的過程，其實哨兵j的使命就是要找小於基準數的數，而哨兵i的使命就是要找大於基準數的數，直到i和j碰頭為止。 void my_sort(int arr[], int left, int right) { if (left >=right) { return; } int low = left; int high = right; int key = arr[low]; while (low < high) { while (low < high && arr[high] >= key) { high--; } arr[low] = arr[high]; while (low < high && arr[low] <= key) { low++; } arr[high] = arr[low]; } arr[low] = key; my_sort(arr, left, low - 1); my_sort(arr, low + 1, right); } //http://developer.51cto.com/art/201403/430986.htm void quicksort(int arr[],int left, int right) { int i, j, t, base; if (left > right) return; base = arr[left]; //temp中存的就是基準數 i = left; j = right; while (i != j) { //順序很重要，要先從右邊開始找 while (arr[j] >= base && i < j) j--; //再找右邊的 while (arr[i] <= base && i < j) i++; //交換兩個數在陣列中的位置 if (i < j) { t = arr[i]; arr[i] = arr[j]; arr[j] = t; } } //最終將基準數歸位 arr[left] = arr[i]; arr[i] = base; quicksort(arr,left, i-1);//繼續處理左邊的，這裡是一個遞迴的過程 quicksort(arr,i + 1, right);//繼續處理右邊的 ，這裡是一個遞迴的過程 } //c語言實現常用排序演算法 //http://c.biancheng.net/cpp/html/2741.html int main(void){ { //int arr[] = { 32, 12, 7, 78, 23, 45, 3, 6, 9 }; int arr[] = { 9, 8, 7, 6, 5, 4, 3, 2, 1, 0 }; int len = arrLen(arr); printf("==========quick_sort============\n"); print(arr, len); quick_sort(arr, 0, len - 1); print(arr, len); } { int arr[] = { 32, 12, 7, 78, 23, 45, 3, 6, 9 }; int len = arrLen(arr); printf("==========bubble_sort============\n"); print(arr, len); bubble_sort(arr, len); print(arr, len); } { //int arr[] = { 32, 12, 7, 78, 23, 45, 3, 6, 9 }; int arr[] = { 9, 8, 7, 6, 5, 4, 3, 2, 1, 0 }; int len = arrLen(arr); printf("==========insert_sort============\n"); print(arr, len); insert_sort(arr, len); print(arr, len); } { int arr[] = { 9,8,7,6,5,4,3,2,1,0 }; int len = arrLen(arr); printf("==========merge_sort============\n"); print(arr, len); merge_sort(arr,0, len-1); print(arr, len); } { int arr[] = { 9, 8, 7, 6, 5, 4, 3, 2, 1, 0 }; int len = arrLen(arr); printf("==========select_sort============\n"); print(arr, len); select_sort(arr, len); print(arr, len); } { int arr[] = { 9, 8, 7, 6, 5, 4, 3, 2, 1, 0 }; int len = arrLen(arr); printf("==========shell_sort============\n"); print(arr, len); shell_sort(arr, len); print(arr, len); } { int arr[] = { 9, 8, 7, 6, 5, 4, 3, 2, 1, 0 }; int len = arrLen(arr); printf("==========heap_sort============\n"); print(arr, len); heap_sort(arr, len); print(arr, len); } { int arr[] = { 9, 8, 7, 6, 5, 4, 3, 2, 1, 0 }; int len = arrLen(arr); printf("==========quick_sort2============\n"); print(arr, len); quick_sort2(arr, len); print(arr, len); } { int arr[] = { 9, 8, 7, 6, 5, 4, 3, 2, 1, 0 }; int len = arrLen(arr); printf("==========my_qsort============\n"); print(arr, len); my_qsort(arr, 0,len-1); print(arr, len); } { int arr[] = { 9, 8, 7, 6, 5, 4, 3, 2, 1, 0 }; int len = arrLen(arr); printf("==========my_sort============\n"); print(arr, len); my_sort(arr, 0, len - 1); print(arr, len); } { int arr[] = { 9, 8, 7, 6, 5, 4, 3, 2, 1, 0 }; int len = arrLen(arr); printf("==========quicksort============\n"); print(arr, len); quicksort(arr, 0, len - 1); print(arr, len); } return 0; }