A programming technique where a function calls itself to solve a problem by breaking it down into smaller, similar subproblems. Each recursive call works on a simpler version until reaching a base case that stops the recursion.
From Latin 'recurrere' meaning 'to run back,' from 're-' (back) + 'currere' (to run). The mathematical concept existed for centuries, but the programming term was formalized in the 1960s when computer scientists realized functions could 'run back' to themselves.
Try Another Word