Recursion: Functions that call themselves

Recursion is when a function calls itself. For recursion to work there has to be a trivial case where the recursion ends.

Try to identify the trivial case in each example.

Please study the material at each of the links below.

  1. Find half of a number recursively
Like us on Facebook:


OER: Open Educational Resource
Creative Commons License Author: Janet E. Joy; Publisher: Zebra0.com
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License
Creative Commons Attribution-NonCommercial 4.0 International License
Last modified: May 18 2017 14:07:41.