@yogesh7132 This is a specific implementation of approximation for e^x using Taylor series expansion unto n terms. Though good, it has some fundamental errors:

1. the factorial computation uses double precision arithmetics and hence already suffers from overflows and rounding off-errors because factorial is supposed to be an integer. To check, try to print the value of fact after 10 terms.
2. The implementation limits should be clearly specified and thus show how the code and the algorithm implementation are valuable.

Please update the code with documentation and standards per the repo. See for example: this code from repo with documentation so that the code is self-explanatory and that the auto-tools can update the documentation website. Dont have to necessarily provide with graphs, but at least the documentation.