![](https://img-blog.csdnimg.cn/20201014180756926.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
acm(排序类)
题目
不会编程怎么行
fighting
展开
-
greater()的用法[用sort+greater()实现降序快排]
转自:https://blog.csdn.net/u014800748/article/details/38449591#include<iostream>#include<algorithm>//因为用了sort()函数 #include<functional>//因为用了greater<int>()using namespace std...转载 2020-01-12 09:35:53 · 2680 阅读 · 0 评论 -
F - 数据结构实验之排序四:寻找大富翁
#include<bits/stdc++.h>using namespace std;int m;int a[1000100];void swap(int x, int y){ int t = a[x]; a[x] = a[y]; a[y] = t;}void siftdown(int i){ int t,flag=0; whi...转载 2020-01-11 10:50:59 · 169 阅读 · 0 评论 -
堆排序
#include<bits/stdc++.h>using namespace std;void swap(int tree[],int i,int j){ int temp = tree[i]; tree[i] = tree[j]; tree[j] = temp;}void heapify(int tree[],int n,int i){ i...原创 2020-05-06 10:43:40 · 75 阅读 · 0 评论 -
归并排序法求逆序数
博客:https://blog.csdn.net/ameir_yang/article/details/53575595视频:https://www.bilibili.com/video/av62759440?from=search&seid=11637699337315514601https://www.bilibili.com/video/av38482791?from=searc...原创 2020-02-24 17:10:25 · 44 阅读 · 0 评论 -
希尔排序
#include<bits/stdc++.h>using namespace std;void shellsort(int a[],int ssize,int gap){ int i,j; for(i = gap; i<ssize; i++) { for(j = i; j-gap>=0&&a[j-gap]>...原创 2020-02-24 21:04:39 · 58 阅读 · 0 评论