Recursive algorithms are a specific, and special, type of algorithm used in solving many classes of problems. Such algorithms typically involve one routine that recursively calls itself one or more times with smaller parameter values (there may also be complex algorithms with more than one recursive routine). This recursive approach can also be thought of as a "divide and conquer" approach--the problem is divided, or broken down, into two or more subproblems of similar nature but smaller size, and then conquered, or solved, at the smaller level. The subproblems are in turn broken down into still smaller ones having the same basic nature but an even smaller size, and so on, until the most elemental problems that have trivial solutions are arrived at. Using these trivial solutions, the solution then propagates up the chain of complexity until the original large problem is...