Write an efficient C+ + function that takes any integer value i and returns 2^i, as a long value. Your function should not multiply 2 by itself i times; there are much faster ways of computing 2^i.

long power (int i)

{

return pow (2, i);

}

Explanation:

The above written function is in C++. It does not uses loop. It's return type is long. It uses the function pow that is present in the math library of the c++. It takes two arguments return the result as first argument raised to the power of second.

for ex:-

pow (3,2);

It means 3^2 and it will return 9.