摘要：
void heapify(vector<int> &arr, int n, int i) { int largest = i; int lson = 2 * i + 1; int rson = 2 * i +2; if (lson < n && arr[lson] > arr[largest]) { 阅读全文
posted @ 2022-03-22 18:52
ainingxiaoguai
阅读(39)
评论(0)
推荐(0)
摘要：
int partition(vector<int> &arr, int left, int right) { int key = arr[right]; int i = left; for (int j = left; j <right; j++) { if (arr[j] < key) { swa 阅读全文
posted @ 2022-03-22 18:38
ainingxiaoguai
阅读(12)
评论(0)
推荐(0)
摘要：
void merge(vector<int> &arr, int left, int mid, int right) { int lpos = left; int rpos = mid + 1; int poss = left; int i = 0; vector<int> tempArr; whi 阅读全文
posted @ 2022-03-22 17:34
ainingxiaoguai
阅读(21)
评论(0)
推荐(0)
摘要：
void shellSort(vector<int> &arr) { int i,j,gap,key; for (gap = arr.size() / 2; gap > 0; gap /= 2) { for (i = gap; i < arr.size(); i++) { key = arr[i]; 阅读全文
posted @ 2022-03-22 17:33
ainingxiaoguai
阅读(16)
评论(0)
推荐(0)
浙公网安备 33010602011771号