GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — algorithms_and_data_structures/math_problems/pow.cpp at master · lualgorithm/algorithms_and_data_structures Expand file tree/ Copy pathpow.cppMore file actions 38 lines (34 loc) · 664 Bytes / Copy pathpow.cppFile metadata and controls38 lines (34 loc) · 664 Bytes 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 /* * A simple divide and conquer approach to calculate pow(x,y) */ #include <iostream> double pow( double x, int y ) { //base case if ( y == 0 ) { return 1; } double temp = pow(x, y/2); if ( y % 2 == 0 ) { return temp * temp; } else { if ( y > 0 ) { return x * temp * temp; } else { return ( temp * temp ) / x; } } } int main() { std::cout << "Program to calculate power y to the base x\n"; double x; int y; std::cout << "Enter base : "; std::cin >> x; std::cout << "Enter power(int + or -) : "; std::cin >> y; std::cout << "Power " << y << " to the base " << x << " is: "; std::cout << pow(x, y) << std::endl; return 0; } |
| You are visitor 01402520 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |