摘要：
/* fi表示第i行的最左最小元素的列小标，则有f0#includeusing namespace std;void findOddMin(vector> &a, int m, int n, vector &r){ int len = r.size(); vector tmp; for (int i... 阅读全文
摘要：
#include#include#include#include#define MAXINT (1= 0 && a[j]>tmp){ a[j + 1] = a[j]; --j; } a[j + 1] = tmp; }}void merge(int *a, int p, int q, in... 阅读全文
摘要：
#include#include#includevoid swap(int *a, int i, int j){ int tmp = a[i]; a[i] = a[j]; a[j] = tmp;}void BubbleSort(int *a, int n){ for (int... 阅读全文
摘要：
#include#include#includeusing namespace std;void swap(int *a, int i, int j){ int tmp = a[i]; a[i] = a[j]; a[j] = tmp;}int partition(int *a, i... 阅读全文