m0_64190853的博客

比较/移动次数&时间复杂度计算

进制

#include<iostream>using namespace std;template<typename T,typename type>bool compare(T a, type b){ float c = a - b; if (fabs(c) > 0) return true; return false;}int main(){ int a; double b; cout << "a:" << endl; cin.

#include<iostream>using namespace std;template<typename T>T mini(T a[], int num){ if (a == NULL) return -1; quick_sort(a, 0, num - 1); return a[0];}template<typename T>int min_re(T a[], int left, int right){ T b = a[left]; w.

本代码结合快排#include<iostream>using namespace std;template<typename T>int min_re(T a[], int left, int right){ T b = a[left]; while (left < right) { while (a[right] >= b && right >left) right--; a[left] = a[right];