約 422,000 件の結果
リンクを新しいタブで開く
  1. Recursion - Wikipedia

    A recursive step — a set of rules that reduces all successive cases toward the base case. For example, the following is a recursive definition of a person's ancestor.

  2. RECURSIVE Definition & Meaning | Dictionary.com

    RECURSIVE definition: pertaining to or using a rule or procedure that can be applied repeatedly. See examples of recursive used in a sentence.

  3. RECURSIVE | English meaning - Cambridge Dictionary

    RECURSIVE definition: 1. involving doing or saying the same thing several times in order to produce a particular result…. Learn more.

  4. What is Recursion? - GeeksforGeeks

    2025年7月23日 · A recursive function must have a base case or stopping criteria to avoid infinite recursion. Recursion involves calling the same function within itself, which leads to a call stack.

  5. Recursion - Glossary | MDN

    2025年12月22日 · 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 …

  6. How Does Recursion Work? Explained with Code Examples

    2024年7月25日 · Recursion involves breaking down a problem into smaller pieces to the point that it cannot be further broken down. You solve the small pieces and put them together to …

  7. RECURSIVE Definition & Meaning - Merriam-Webster

    2012年12月6日 · The meaning of RECURSIVE is of, relating to, or involving recursion. How to use recursive in a sentence.

  8. 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 …

  9. Recursive function | Recursion, Algorithms, Programming

    recursive function, in logic and mathematics, a type of function or expression predicating some concept or property of one or more variables, which is specified by a procedure that yields …

  10. Introduction to Recursion - GeeksforGeeks

    2025年10月25日 · 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 …