recursion

Algorithmic technique in computer science of solving a problem by reducing it to a smaller instance of the same problem

Entitycomputer science term algorithmic paradigmQ264164

Also known as recursive algorithm · recursing

Instance of: computer science term
, algorithmic paradigm
Subclass of: algorithm

Overview

From Wikipedia, the free encyclopedia · Read full article · Text CC BY-SA 4.0

In computer science, recursion is a method of solving a computational problem where the solution depends on solutions to smaller instances of the same problem. Recursion solves such recursive problems by using functions that call themselves from within their own code. The approach can be applied to many types of problems, and recursion is one of the central ideas of computer science.The power of recursion evidently lies in the possibility of defining an infinite set of objects by a finite statement. In the same manner, an infinite number of computations can be described by a finite recursive program, even if this program contains no explicit repetitions.

Overview

All data

19 statements · 5% with external sources · numbers in brackets are citations

Has characteristic: recursion
self-reference
Studied by: algorithmics
Uses: subroutine call has characteristic: self-reference · nature of statement: often

On other databases

13 identifiers linking recursion across the web's reference databases

Data quality

statements

externally sourced

Source last edited September 4, 2026. AIDB refreshes this page daily.

Suggest a fact or correction

Links

Use this data

curl https://aidb.si/api/v1/entities/Q264164

API docs, limits & keys

Cite this page

AIDB. (2026). recursion (Q264164). Retrieved from https://aidb.si/e/recursion-Q264164