About 151,000 results
Open links in new tab
  1. Recursion - Wikipedia

    So a sentence can be defined recursively (very roughly) as something with a structure that includes a noun phrase, a verb, and optionally another sentence. This is really just a special …

  2. RECURSIVE Definition & Meaning - Merriam-Webster

    The meaning of RECURSIVE is of, relating to, or involving recursion. How to use recursive in a sentence.

  3. RECURSIVELY | English meaning - Cambridge Dictionary

    We get a recursively defined sequence of sets. The algorithm is applied recursively using the next component for comparison. We keep doing this recursively until the list is empty. A subroutine …

  4. Introduction to Recursion - GeeksforGeeks

    May 20, 2025 · The process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one …

  5. What is recursion and when should I use it? - Stack Overflow

    In general, code written recursively is shorter and a bit more elegant, once you know how to read it. There is a technique that language implementers can use called tail call optimization which …

  6. Recursion - Glossary | MDN - MDN Web Docs

    May 23, 2025 · The act of a function calling itself, recursion is used to solve problems that contain smaller sub-problems. A recursive function can receive two inputs: a base case (ends …

  7. Understanding Recursion: A Key Concept in Algorithms

    Nov 22, 2023 · Recursion, in the context of algorithms, is a powerful programming concept where a function calls itself during its execution. It involves breaking down a complex problem into …

  8. What is Recursive? - Computer Hope

    Dec 31, 2022 · In computer programming, the term recursive describes a function or method that repeatedly calculates a smaller part of itself to arrive at the final result. It is similar to iteration, …

  9. How Recursion Works — Explained with Flowcharts and a Video

    Aug 22, 2017 · In its simplest form, a recursive function is one that calls itself. Let me try to explain with an example. Imagine you go to open your bedroom door and it’s locked. Your …

  10. Recursion (computer science) - Wikipedia

    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. [1][2] Recursion solves such …

Refresh