Okuzeka
Software Engineering vocabulary · Data Structures and Algorithms

Recursion

Meaning in software engineering, with examples

/rɪˈkɜːrʒən/nounCommon term

In software engineering, recursion means: A technique where a function solves a problem by calling itself on a smaller part of the same problem until it reaches a simple case.

In Turkish: özyineleme, rekürsiyon

How it is used

Common with trees, folders and nested data. Every recursive function needs a 'base case' that stops it; without one, you get a 'stack overflow'. The adjective is 'recursive'.

Example sentences

  1. We use recursion to walk through the folder tree and count all the files.

  2. The recursive call never stops because the base case is wrong.

Common collocations

  • use recursion
  • recursive function
  • base case
  • deep recursion
  • functionA named block of code that does one job. It can take input values, and it often returns a result to the code that called it.
  • algorithmA clear, step-by-step method for solving a problem or doing a task, such as sorting a list or finding the shortest route between two points.
  • loopA piece of code that repeats the same steps several times, for example once for every item in a list or until a condition becomes false.
  • time complexityHow the number of steps an algorithm takes grows as the size of its input grows, usually written in Big O notation.

More terms: Data Structures and Algorithms

Practise with graded reading

Reading at the right level is the fastest way to make new words stick. Pick free English books by level: