is fast power recursion more efficient than using bitmasking ? which is the most efficient way to calculate the power?
Most efficient method of finding power
Both have almost the same time complexiy because in bitmaking it traverses the bits which are logN in number and the fast power method is of logN time complexity as well so they are almost same in terms of time complexity . Both are equally efficient