skip to main |
skip to sidebar
More content will be added soon , if you have any different or better solution then please post in the comment section of the respective question.
Labels
- Adhoc Programs (20)
- Arrays (5)
- C (120)
- C++ (1)
- Free ebooks (1)
- Graph (1)
- Hash (1)
- Heap (1)
- Linked Lists (22)
- Object Oriented Design (1)
- Online video Lectures (17)
- Puzzles (2)
- Queue (1)
- Stack (1)
- Strings (20)
- Trees (26)
1 comments:
Method 1: brute force
int pow(int x, int y)
{
if(y == 1) return x ;
return x * pow(x, y-1) ;
}
Method 2: Efficient logarithmic time complexity
long pow(long x, long n)
{
long result = 1;
while ( n ) {
if ( n & 1 ) {
result = result * x;
n = n-1;
}
x = x*x;
n = n/2;
}
return result;
}
Post a Comment