recursion

İngilizce - Türkçe

recursion teriminin İngilizce Türkçe sözlükte anlamı

(Bilgisayar) özçağrı

(Bilgisayar,Teknik) tekrarlama

Görünüşe göre, o hiç tekrarlama duymamıştı. - Apparently, he had never heard of recursion.

yineleme

özyineleme

Özyinelemeyi anlamak için önce özyinelemeyi anlamalısın. - To understand recursion you first need to understand recursion.

oZYiNELEME

İlgili Terimler

recursion formula

(Matematik) yinelgen formül

İngilizce - İngilizce

recursion teriminin İngilizce İngilizce sözlükte anlamı

The act of recurring

The calling of a function from within that same function

This function uses recursion to compute factorials.

The act of defining an object (usually a function) in terms of that object itself

n! = n × (n − 1)! (for n > 0) or 1 (for n = 0) defines the factorial function using recursion.

{n} a return

(mathematics) an expression such that each term is generated by repeating a particular mathematical operation

The process of generating a sequence (or pattern) from a given first term by applying a rule to obtain any succeeding term from the preceding term (Lesson 1 2)

The facility of a programming language to be able to call functions from within themselves

a reduction of a problem to another (typically smaller) instance of the same problem

(see RECURSION)

Recursion results from a method being invoked when an existing call to the same method has not yet returned For instance public static void countDown(int n){ if(n >= 0){ System out println(n); countDown(n-1); } // else - base case End of recursion } See direct recursion, indirect recursion and mutual recursion for the different forms this can take

The use of recursive definitions to accomplish real things Contrast just going around in circles

A programming algorithm where a function either directly or indirectly calls itself

The act of a routine directly or indirectly calling itself

{i} programming method in which a routine or function rereads itself several times until a specific condition is met (Computers)

The act of recurring; return

A function that calls a simpler version of itself to arrive at a solution For example, the factorial function (n!) can be defined recursively as (n(n-1)!), where (0!) is defined as equal to1 If a function calls another function that calls back the original function again, it is called mutual recursion; most ray-tracing programs fall into this general category

Pertains to a subroutine or function that directly or indirectly references itself

The definition of an operation in terms of itself

the result of a program or command running a new version of itself If done carelessly this can cause a never-ending loop However as a programming technique it is often used to simplify such tasks as searching down through a directory tree

When a function calls itself, either directly or indirectly If this isn't clear, refer to the entry for "recursion"

Recursion occurs when a piece of code is executed before a previous execution of the same code has terminated; for example, when a program calls itself Code that is capable of being executed in this way is called re-entrant; its instructions must be invariable, and it must define its variables in local-storage so that data from one instance of the code does not interfere with data from another instantiation Recursion is common when using shared library routines, such as in object-oriented programming, API programming, and when packaging code in dynamic link libraries

A technique where a problem is solved by solving smaller sections within it using a function which calls itself

The property of a function looking back at itself for something "GNU", for instance, stands for "GNU's Not UNIX", thus recursing upon itself for definition For further clarity, see Infinite Loop

Given some starting information and a rule for how to use it to get new information, the rule is then repeated using the new information (cf Recursion Discussion)

The ability of a program to call itself which also enables a program to define itself in terms of itself This is frequently used to control the programs execution

In programming a recursive function calls itself As in all programming methods, it helps to make sure the process eventually stops

n See {recursion} See also {tail recursion}

When a function calls itself

A process, function, or routine that executes continuously until a specified condition is met

When a function calls itself, either directly or indirectly If this isn't clear, refer to the entry for "recursion "

the act of a function calling itself

A subroutine that can be entered from within itself or from outside itself, but not from any other point, and that may not be exited while the initial condition holds, or while any other condition holds unless there is a note to the contrary in the manual

İlgili Terimler

recursion theory

A branch of mathematical logic studying computable functions and Turing degrees, concerned with questions such as "What does it mean for a function from the natural numbers to themselves to be computable?" and "Can noncomputable functions be classified into a hierarchy based on their level of noncomputability?"

primitive recursion

Recursion to a fixed depth

primitive recursion

The operator \rho\, that creates a new function from two functions g\, and h\, such that: \begin{align}

tail recursion

The technique of writing a function so that recursive calls are only done immediately before function return, particularly when recursive control structures are used in place of iterative ones

recursions

plural of recursion

Heceleme

re·cur·sion

Etimoloji

() From Latin recursiō (“the act of running back or again, return”), from recurrō (“run back; return”), from re- (“back, again”) + currō (“run”).