Recursive

Pronunciation: /rɪˈkɜr.sɪv/ Explain

A definition is recursive if it makes use of a repeated algorithm. An example of a recursive definition of a sequence is 'Start with the number 1 and add two for each iteration.' The sequence defined is { 1, 3, 5, 7, ... }.

Cite this article as:

McAdams, David E. Recursive. 12/21/2018. All Math Words Encyclopedia. Life is a Story Problem LLC. http://www.allmathwords.org/en/r/recursive.html.

Revision History

12/21/2018: Reviewed and corrected IPA pronunication. (McAdams, David E.)
12/4/2018: Removed broken links, updated license, implemented new markup. (McAdams, David E.)
10/17/2007: Initial version. (McAdams, David E.)

All Math Words Encyclopedia is a service of Life is a Story Problem LLC.
Copyright © 2018 Life is a Story Problem LLC. All rights reserved.
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License