排序算法
阿翔同学
这不是通往幼儿园的车车
展开
-
排序算法-堆排序
// (堆排序-大堆) 使用数组来表示 二叉树型结构static void down_adjust(int array[], int size, int father) { int r_chirld = 0; int l_chirld = 0; bool flag = false; for (int cur = father; cur <= size / 2 - 1; ) { r_chirld = (cur + 1) * 2; l_chirld = (cur + 1) * 2 - .原创 2022-04-09 15:54:41 · 819 阅读 · 0 评论 -
快速排序
#include <iostream>#include <assert.h>#include <Windows.h>using namespace std;intpartial_cmp(int* str, int left, int right){ assert(str && left >= 0 && ...原创 2019-12-07 12:24:58 · 99 阅读 · 0 评论 -
归并排序
#include <iostream>#include <string.h>#include <assert.h>#include <Windows.h>using namespace std;void MyStrCpy(int* buf, const int* str, int lenth){ assert(buf &...原创 2019-12-07 12:23:56 · 92 阅读 · 0 评论 -
希尔排序
void // 希尔排序(插入排序的改进版)ShellSort(int str[], int len){ assert(str && len >= 0); int garp = len / 2; int tmp = 0; int pre_index = 0; for ( ; garp > 0; garp /= 2) ...原创 2019-12-07 12:22:09 · 68 阅读 · 0 评论 -
选择排序
#include <iostream>#include <assert.h>#include <Windows.h>using namespace std;void swap(int& a, int& b){ auto tmp = a; a = b; b = tmp; return;}/*把最大的放在最后面*/vo...原创 2019-11-26 17:37:39 · 114 阅读 · 0 评论 -
插入排序
#include <iostream>#include <assert.h>#include <Windows.h>using namespace std;// 插入排序voidInsertSort(int* str, int len){ assert(str && len >= 0); int tmp = 0; ...原创 2019-11-26 17:34:51 · 110 阅读 · 0 评论 -
冒泡排序
#include <iostream>#include <assert.h>#include <Windows.h>using namespace std;static int DeBug = 1;void swap(int& a, int& b){ auto tmp = a; a = b; b = tmp; retu...原创 2019-11-26 17:33:03 · 115 阅读 · 1 评论