Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
pow implementation
//Title of this code #include <iostream> using namespace std; // http://stackoverflow.com/questions/5231096/time-complexity-of-power int power(int a, int b) { if (b < 0) return 0; int pow = 1; while ( b ) { if ( b & 1 ) { pow = pow * a; --b; } a = a*a; b = b/2; } return pow; } int mypow(int a, int b) { int ret = 1; for (int i = 0; i < b; ++i) ret *= a; return ret; } int main() { std::cout << power(2,-10); }
run
|
edit
|
history
|
help
0
Please
log in
to post a comment.
string iteration performance
c++ car racing game
File System
cppPyClamInher
DP Optimization another kind
Merge intervals leetcode
project euler problem - 3
fundamental type sizes
345325
gp series
Please log in to post a comment.