does recursive functions become inefficient if the single computation include 10^6 to 10^16 function calls and there are total 10^16 such computations…??
Recursive calls are based on stack i.e. the calls need the stack space saving various parameters for every call. So many recursive calls will very first lead to stack overflow error and throw a RTE exception I believe because of large auxillary space demand of your code. There’ll (at maximum) be 10^32 calls as per your data above. So, that w’d be inefficient. Also, if you’ll think in terms of time complexity, it’ll take noticeable time.
okay… thanks @damn_me