weixin_40691723的博客

#include <iostream> #include <algorithm> 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...

核心思想：将指数exponent分为2的最大指数之和。 #include <iostream> using namespace std; double Power(double base, int exponent) { if (exponent == 0) //任何数的0次幂为0 return 1; if (base >= -1e-8 &...