weixin_38679101的博客

//直接插入排序算法void InsertSort(int a[],int n) { for (int i = 1; i < n; i++) { if (a[i] < a[i - 1]) { int j = i - 1; int tmp = a[i]; while (tmp < a[j]) { a[j + 1] = a[j]; j--;...

void Merge(int arr[],const int left,const int right,const int middle){ int temp[right-left+1]; int i = left; int j = middle + 1; int k = 0; int m = 0; while(i <= middle &a...

void BubbleSort(vector<int> &arr){ if(arr.size() == 0) return; for(int i = 0; i < arr.size();i++) for(int j = 0;j < arr.size()-i;j++) { if...

#include <iostream>using namespace std; void adjust_heap(int* a, int node, int size){ int left = 2*node + 1; int right = 2*node + 2; int max = node; if( left...

//堆排序//需要先做heapify操作void heapify(vector<int> &tree,int n, int i) //tree代表需要处理的数组，n代表数组长度，i代表是需要对哪个节点进行操作。{ if(i >= n){ return; } int c1 = 2 * i + 1; int c2 =...

#include <iostream>#include <vector>#include <cstdlib>using namespace std;//从小到大排序void QuickSort(int left, int right, vector<int>& arr){ //越界条件 if(left &gt...