Few clever algorithms for fast power x^N
This commit is contained in:
parent
604b19ce74
commit
530c6f4fcd
2 changed files with 79 additions and 0 deletions
20
sample/testAlgo.cpp
Normal file
20
sample/testAlgo.cpp
Normal file
|
@ -0,0 +1,20 @@
|
|||
#include <iostream>
|
||||
#include <stdio.h>
|
||||
#include "algo.hpp"
|
||||
|
||||
using namespace CosmoTool;
|
||||
using namespace std;
|
||||
|
||||
int main(int argc, char **argv)
|
||||
{
|
||||
cout << square(2) << endl;
|
||||
cout << cube(2) << endl;
|
||||
cout << square(2.1f) << endl;
|
||||
cout << cube(2.1f) << endl;
|
||||
|
||||
cout << spower<2>(2.1f) << endl;
|
||||
cout << spower<3>(2.1f) << endl;
|
||||
cout << spower<4>(2.1f) << endl;
|
||||
cout << spower<5>(2.1f) << endl;
|
||||
return 0;
|
||||
}
|
Loading…
Add table
Add a link
Reference in a new issue