Recursion: Beyond Factorial by George Morrone Recursion is the application o f a d i v i d e - a n d - c o n q u e r strategy to a computational problem. B y breaking a problem into smaller parts, it is easier to solve, as long as there is a w a y to c o m b i n e the solutions back into a solution to the original problem. In a particular p r o g r a m m i n g language, a recursive subroutine is one that calls itself. Recursion is the natural and e a s y w a y to state the solution to m a n y computational problems, including quicksort, binary array search, and graph searching, including binary tree search. F o r e x a m p l e , t h e f a c t o r i a l f u n c t i o n is o f t e n u s e d to illustrate r e c u r s i o n . F(3) = 3 * F(2). F(2) = 2 * F(1). E
/lp/association-for-computing-machinery/recursion-beyond-factorial-Zzt90Loo5F