About 5,970,000 results
Open links in new tab
  1. What is recursion and when should I use it? - Stack Overflow

    A recursive statement is one in which you define the process of what to do next as a combination of the inputs and what you have already done. For example, take factorial:

  2. c - self referential struct definition? - Stack Overflow

    Feb 26, 2009 · self referential struct definition? Asked 16 years, 10 months ago Modified 3 months ago Viewed 160k times

  3. Recursive class definitions in Python - Stack Overflow

    Jul 25, 2012 · As the title of the question indicated, I really wanted to know how to recursively nest a class definition. I am sure there are many ways to 'skin the fluent-interface-in-python cat'.

  4. Recursive definition of set strings over {a,b} that contains one b …

    Nov 20, 2014 · 1 When looking for a recursive definition, start by identifying the base cases and then look for the recursive steps - like you're doing induction. What are the smallest strings in …

  5. Defining a recursive type hint in Python? - Stack Overflow

    115 You can specify recursive types in the typing language by using type aliases and forward reference strings,

  6. JSON Schema - Recursive Schema Definition - Stack Overflow

    Dec 24, 2013 · JSON Schema - Recursive Schema Definition Asked 12 years ago Modified 6 years, 3 months ago Viewed 32k times

  7. rocq prover - Coq: Recursive definition of fibonacci is ill-formed ...

    May 30, 2021 · Recursive definition of fibonacci is ill-formed. In environment fibonacci : nat -> nat n : nat n0 : nat n' : nat Recursive call to fibonacci has principal argument equal to "S n'" …

  8. c++ - Can we have recursive macros? - Stack Overflow

    Sep 16, 2012 · I want to know if we can have recursive macros in C/C++? If yes, please provide a sample example. Second thing: why am I not able to execute the below code? What is the …

  9. What's the use of this mutually recursive type definition in OCaml ...

    Feb 1, 2025 · Below is a valid variant type definition in OCaml. (source) type t = U of u and u = T of t Is there a use for it? And how to create a value of type t? Or type u?

  10. algorithm - What is tail recursion? - Stack Overflow

    Aug 29, 2008 · Tail Recursive Function is a recursive function in which recursive call is the last executed thing in the function. Regular recursive function, we have stack and everytime we …