MLchartDataset catalogue

Recursion

Term · Computing and IT · MLC-T-CMP-001004

A method of solving a problem where the solution depends on solutions to smaller instances of the same problem. In programming, this is achieved when a function calls itself directly or indirectly to solve a subproblem. Every recursive function must have a base case, a condition under which it stops calling itself to prevent an infinite loop.

Table 1. Record
IdentifierMLC-T-CMP-001004
FieldComputing and IT
SubjectTechnical
Record as JSON 
{
  "id": "MLC-T-CMP-001004",
  "term": "Recursion",
  "field": "Computing and IT",
  "definition": "A method of solving a problem where the solution depends on solutions to smaller instances of the same problem. In programming, this is achieved when a function calls itself directly or indirectly to solve a subproblem. Every recursive function must have a base case, a condition under which it stops calling itself to prevent an infinite loop.",
  "subject": "Technical",
  "url": "https://mlchart.com/terminology/computing/recursion/"
}

Record 1,104 of 1,553 in Computing and IT terminology (MLC-0101). Request the full dataset.