#include<math>'s pow() complexity !?

#1

Does pow(a,N) function in header file works in O(Log(N)) or O(N) ?

#2

@raju_sirigineedi
It really depends from system to system and on the architecture you are using. It is generally a constant time operation.
For an average case, you could consider it to be O(log n) but in some cases it can go to O(n) so it is better to write and use your own power function.