排序算法
关注
分享
扫一扫
iw·楊東
坚定梦想，追逐梦想
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
算法排序之快速排序
#include <iostream>using namespace std;void sort(int *a, int start, int end){ if(start < end) { int key = a[start]; int low = start; int high = end; while(low < high) { ...原创 2018-06-21 12:16:53 · 233 阅读 · 0 评论 -
算法排序之归并排序
#include <iostream>using namespace std;void mergeArray(int *a, int first, int mid, int last, int *temp){ int i = first; int j = mid + 1; int m = mid; int n = last; int k = 0; while (i...原创 2019-02-14 12:27:06 · 232 阅读 · 0 评论 -
算法排序之希尔排序
#include <iostream>using namespace std;void shellSort(int *a, int n){ int gap,i,j,temp; for (gap = n / 2; gap > 0;gap /= 2) { for (i = gap; i < n;i++) { if (a[i]<a[i-gap...原创 2019-02-14 14:14:27 · 203 阅读 · 0 评论 -
算法排序之堆排序
#include <iostream>using namespace std;void Swap(int &a, int &b){ a ^= b; b ^= a; a ^= b;}void MinHeap(int *a, int i,int n){ int j, temp; j = 2 * i + 1; temp = a[i]; while...原创 2019-02-14 15:35:19 · 294 阅读 · 1 评论