Content deleted Content added
→Recursive data types: I guess, "unknown to" is more appripriate (should be decided by a native English speaker, which I'm not) |
Programinfo (talk | contribs) m when a function calls itself is called recursion. |
||
Line 455:
<blockquote>
As long as a programmer derives the template from a data definition, functions employ structural [https://www.chlopadhe.com/recursion-in-c/ recursion]. That is, the recursions in a function's body consume some immediate piece of a given compound value.<ref name="Felleisen 2002 108"/>
</blockquote>
Line 788:
* If <Math>f(n) = \Omega(n ^ { \log_b a + \epsilon})</Math> for some constant <Math>\epsilon > 0</Math>, and if <Math>a \cdot f(n / b) \leq c \cdot f(n)</Math> for some constant {{mvar|c}} < 1 and all sufficiently large {{mvar|n}}, then <Math>T(n) = \Theta(f(n))</Math>
where {{mvar|a}} represents the number of recursive calls at each level of recursion, {{mvar|b}} represents by what factor smaller the input is for the next level of recursion (i.e. the number of pieces you divide the problem into), and {{math|''f'' (''n'')}} represents the work the function does independent of any recursion (e.g. partitioning, recombining) at each level of [https://www.chlopadhe.com/recursion-in-c/ recursion in c].
==See also==
| |||