Your Web News in One Place

Help Webnuz

Referal links:

Sign up for GreenGeeks web hosting
June 17, 2022 06:33 pm GMT

Computing power

Ok so your interviewer asks you write a function to find the power of a number. We have all used Math.pow() in JAVA, pow() function in C/C++, but have you wondered how to compute the power without using these????

Let's find out.

Example:
x = 2
y = 3
Output = 8 ( 2 to the power 3 = 2 *2 *2)

Naive Solution: Time Complexity = O(n)
Image description

Output:
Image description

Recursive Solution:
Time Complexity = (logn)
Space Complexity = (logn)
Image description

Output:
Image description

It has recursive function calls which will take space in function call stack. It also has overhead for function call in return.

Can you think of a better solution?
How about an Iterative solution?
Do share your views in the comments.


Original Link: https://dev.to/hebashakeel/computing-power-53fm

Share this article:    Share on Facebook
View Full Article

Dev To

An online community for sharing and discovering great ideas, having debates, and making friends

More About this Source Visit Dev To