OpenSoure_Repos/TheAlgorithms-C-Plus-Plus
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git synced 2023-10-11 13:05:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

use template based functions

Browse Source
This commit is contained in:
Krishna Vedala 2020-05-27 15:14:30 -04:00
parent 757970dbae
commit d262065492
No known key found for this signature in database
GPG Key ID: BA19ACF8FC8792F7
1 changed files with 6 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
math/fast_power.cpp
View File

@ -21,16 +21,17 @@
/**
* algorithm implementation for \f$a^b\f$
*/
double fast_power_recursive(int64_t a, int64_t b) {
template <typename T>
double fast_power_recursive(T a, T b) {
// negative power. a^b = 1 / (a^-b)
if (b < 0) return 1.0 / fast_power_recursive(a, -b);
if (b == 0) return 1;
int64_t bottom = fast_power_recursive(a, b >> 1);
T bottom = fast_power_recursive(a, b >> 1);
// Since it is integer division b/2 = (b-1)/2 where b is odd.
// Therefore, case2 is easily solved by integer division.
int64_t result;
double result;
if ((b & 1) == 0) // case1
result = bottom * bottom;
else // case2
@ -42,7 +43,8 @@ double fast_power_recursive(int64_t a, int64_t b) {
Same algorithm with little different formula.
It still calculates in O(logN)
*/
double fast_power_linear(int64_t a, int64_t b) {
template <typename T>
double fast_power_linear(T a, T b) {
// negative power. a^b = 1 / (a^-b)
if (b < 0) return 1.0 / fast_power_linear(a, -b);