Recursion A recursive function calls itself, either directly or indirectly. A recursive function knows how to solve only the simplest case(s), or so-called base case(s). If the function is called with a base case, the function simply returns a result. If the function is called with a more complex problem, the function typically divides the problem into two conceptual pieces–a piece that the function knows how to do, and a piece that it does not know how to do. To make recursion feasible, the latter piece must resemble the original problem, but be a slightly simpler or slightly smaller version of it. For recursion, to terminate, the sequence of recursive…

Function Templates Overloaded functions typically perform similar operations that involve different program logic on different data types. If the program logic & operations are identical for each data type, overloading may be performed more compactly & conveniently using function templates. Given the argument types provided in calls to a function template, C++ automatically generates separate function template specializations to handle each type of call appropriately. All function template definitions begin with the ‘template‘ keyword followed by a template parameter list to the function template enclosed in angle brackets ( <> ). The formal type parameters are placeholders for fundamental types or user-defined types. These placeholders are used to specify the…