answersLogoWhite

0


Want this question answered?

Be notified when an answer is posted

Add your answer:

Earn +20 pts
Q: Function calling itself is the process known as?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

What is the difference between the calling function and called function?

Function calling is when you call a function yourself in a program. While function invoking is when it gets called automatically.For example, consider this programstruct s{int a,b,s;s(){a=2;b=3;}void sum(){s=a+b;}};void main(){struct s obj; //line 1obj.sum(); // line 2}Here, when line 1 is executed, the function(constructor, i.e. s) is invoked.When line 2 is executed, the function sum is called.


What is function parameters?

whatever the variables we declare in function signature to receive the arguments at the calling that are known as parameters.. e.g. int sum(int a,int b); here a & b are known as parameters.....


The process by which a green plant makes its own food is included in the life function known as?

the process is called photosynthesis.


Does the appendix have any known function in the digestive process?

No it does not. It is a vestigial organ thought to function in the digestive system in some of our ancestors.


What function does leaves have on plants?

The primary function of leaves is to make food for the plant. This happens through a process known as photosynthesis.


How long is Puerto Rico known as a country?

It began calling itself a Commonwealth in 1952, but under International Law it remains an unincorporated US Territory


What is parameter in functions?

whatever the variables we declare in function signature to receive the arguments at the calling that are known as parameters.. e.g. int sum(int a,int b); here a & b are known as parameters.....


What is 5 equal to in the equation 154a-5?

154a - 5 is not an equation, as there is no relation between two unknowns, or an unknown or a known. But to answer your question, 5 is always equal to 5, except when 5 is a constant function, in which case it is a function which is always equal to 5, but is not 5 itself - because 5 itself is a scalar while the function 5 is a function.


What is DNA during replication?

DNA replicates as part of cell division, during which it is (obviously) replicating itself in the process known as mitosis.


In C plus plus How does a function pass control back to the calling function?

The calling code pushes the return address onto the call stack. When the function returns, it pops the return address off the call stack and returns control to that address. The call stack (or simply the stack), is also used to pass parameters to functions and to receive return values from functions, as well as for local storage, evaluation, and the this pointer when calling class member functions. Functions that call other functions, or that recursively call themselves, will increase consumption of the call stack accordingly. This is known as winding, because the return addresses will remain on the stack until the function is ready to return (even if the function calls itself or another function), thus allowing functions to automatically unwind. In other words, it's a bit like leaving a trail of breadcrumbs (as per the Hansel & Gretel fairytale) allowing functions to retrace their steps back to the original call site and, ultimately, back to the main function.


What is the function of a atrium?

The atria collect blood and provide for "topping off" of the ventricles after passive filling has occurred. This process is known as the atrial kick.


How many types of recursion are there in c language?

Recursion in c language is a method where the function calls itself, within or outside the scope. Using Recursion, complicated problems can be divided into smaller parts so that solving them becomes more manageable. The recursion technique is available in Java, JavaScript, and C++.serves the same purpose. The type of Recursion in C • Direct Recursion • Indirect Recursion. Direct Recursion Recursion can call the function n-number of times. In the case of direct Recursion, the function calls itself inside the same position or in the local scope Direct Recursion problems are the Fibonacci series, a program to print 50 natural numbers. Indirect Recursion In the case of Indirect Recursion, a function X calls function Y, and function Y calls any function Z. Under certain conditions, function Z calls function A. In this case, function A is indirectly related to function Z. Indirect Recursion is also known as mutual Recursion, as more than one function runs a program. It is a two-step recursive function call process for making a recursive function call. Below mentioned are also type of Recursion: Tail Recursion No Tail/Head Recursion Linear Recursion Tree Recursion Tail Recursion A function is said to be tail recursion if it calls itself and also calls the last or the previous statement executed in the process. Head Recursion A function is said to be Head Recursion if it calls itself and also calls the first or the beginning statement executed in the process. Linear Recursion A function is said to be a linear recursive function if it makes a single call to itself each time the procedure executes itself and grows linearly depending on the size of the problem. Tree Recursion Tree Recursion is different from linear Recursion. Rather than making only one call to itself, that function makes more than one recursive call to the process within the recursive function. Following are the steps to solve the recursive problem in C: Step 1: Create a function and assign the work a part should do. Step 2: Select the subproblem and assume that the function already works on the problem. Step 3: Get the answer to the subproblem and use it to resolve the main issue. Step 4: The 90% of the problem defined is solved.