![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
排序
c15195989553
这个作者很懒,什么都没留下…
展开
-
直接插入排序
#include <stdio.h>void InsertSort(int par_array[], int array_size){ int i, j; int temp; for (i = 1; i < array_size; i++) { temp = par_array[i]; for (j = i - 1; j >= 0; j--) { if (temp...原创 2018-03-09 13:36:57 · 95 阅读 · 0 评论 -
希尔排序
#include <stdio.h>void ShellSort(int array[], int length){ int i, j; int h; int temp; for (h = length / 2; h > 0; h = h / 2) { for (i = h; i < length; i++) { temp = array[i]; for (j ...原创 2018-03-09 13:38:42 · 126 阅读 · 0 评论 -
选择排序
#include <stdio.h>void SelectSort(int *a, int n){ int i, j; int temp = 0; int flag = 0; for (i = 0; i < n - 1; i++) { temp = a[i]; flag = i; for (j = i + 1; j < n; j++) { if (a[j] &l...原创 2018-03-09 13:38:06 · 149 阅读 · 0 评论 -
冒泡排序
#include <stdio.h>void BubbleSort(int array[], int len){ int i, j; int temp; for (i = 0; i < len -1; ++i) { for (j = len - 1; j > i; --j) { if (array[j] < array[j - 1]) { temp ...原创 2018-03-09 13:37:53 · 96 阅读 · 0 评论 -
快速排序
#include <stdio.h>void Sort(int array[], int low, int high){ int i, j; int index; if (low >= high) { return; } i = low; j = high; index = array[i]; while (i < j) { while (i < j &&...原创 2018-03-09 13:37:31 · 85 阅读 · 0 评论 -
堆排序
#include <stdio.h>void AdjustMinHeap(int *a, int pos, int len){ int temp; int child; for (temp = a[pos]; 2 * pos + 1 <= len; pos = child) { child = 2 * pos + 1; if (child < len &&...原创 2018-03-09 13:37:15 · 77 阅读 · 0 评论 -
归并排序
#include <stdio.h>#include <stdlib.h>void Merge(int array[], int start, int middle, int end){ int i, j, k, n1, n2; n1 = middle - start + 1; n2 = end - middle; int *L = (int...原创 2018-03-09 13:36:40 · 91 阅读 · 0 评论 -
基数排序
#include <stdio.h> #include <stdlib.h> int RadixCountSort(int *index, int *a, int len) //收集 { int *count = (int *)malloc(sizeof(int) * 10); int i; for (i = 0; i < len; ++i) ...原创 2018-03-09 13:36:23 · 77 阅读 · 0 评论