How to Compute the Greatest Common Divisor of Strings?
For strings S and T, we say “T divides S” if and only if S = T + … + T (T concatenated with itself 1 or more times) …
Tag: tail recursion optimisation
C/C++ Coding Exercise – Recursive Computation of Value e
September 5, 2014
algorithms, beginner, c / c++, code, code library, math, optimization, programming languages, recursive, tricks
1 Comment
We all know the formula to compute value e (mathematical constant that is the base of the natural logarithm) is e = 1 + 1/1！+ 1/2！+ .....+ 1/n！ Now, …
