![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
排序算法
耿帅
加油加油加油
展开
-
快速排序算法
#includeusing namespace std;void quicksort(int* tem, int left, int right){ if(left >= right) { return ; } else { int init_left = left, init_right = right; int pivot = tem[left]; while原创 2018-01-04 15:08:33 · 257 阅读 · 0 评论 -
归并排序算法
#include#includeusing namespace std;void merge_sort(int* init_array,int* tem, int left, int right){ if(left >= right) return ; else { int start = left; int mid = (left + right) / 2;原创 2018-01-04 15:09:30 · 198 阅读 · 0 评论 -
利用树的堆排序方法
#include#include#include#includeusing namespace std;struct node{ int value; node* left; node* right; node(int v) { value = v; left = NULL; right = NULL; }};bool swap_value(node*原创 2018-01-04 16:51:11 · 380 阅读 · 0 评论