How is recursion handled internally, Computer Engineering

Assignment Help:

How is recursion handled internally?

Internally, every recursive call to a function requires storing the intermediate values of the parameters and local variables in a run time stack. The common algorithm for any recursive procedure having the following steps:

 1. Save the parameters, local variables and return address.

 2. If the base criterion has been arrived, then perform the final computation and go to step 3, or else perform the partial computation and go to step 1 with condensed parameter values (initiate a recursive call).

 3. Restore the most newly saved parameters, local variables and return address. Go to this return address.

 


Related Discussions:- How is recursion handled internally

Propositional logic - artificial intelligence, Propositional Logic - artifi...

Propositional Logic - artificial intelligence: This is a limited logic, which permit  us to write sentences about propositions - statements about the world - which can either b

Compute physical address of data byte, Q. Compute Physical address of data ...

Q. Compute Physical address of data byte? Offset of data byte = 0020h Value of data segment register (DS) = 3000h Physical address of data byte   This computation

Delete a user from a category, Execute the following functionality using Ja...

Execute the following functionality using Java & SQL with simple GUI interface: 1.  Insert/delete/update an XML document.  2.  Insert/delete/update a category.  3.  Alloca

What are the application-oriented languages, What are the Application-orien...

What are the Application-oriented languages Application-oriented languages are highest level, meaning very easy to write and assembly languages are the lowest, meaning hardest

What are the dynapro keywords, What are the dynapro keywords? FIELD, MO...

What are the dynapro keywords? FIELD, MODULE, SELECT, VALUES and CHAIN are the dynapro keywords

How many lists can a program can produce, How many lists can a program can ...

How many lists can a program can produce? Every program can produce up to 21 lists: one basic list and 20 secondary lists.  If the user makes a list on the next level (that is,

Explain isdn address structure and its working, Draw the ISDN address struc...

Draw the ISDN address structure and explain how the addressing works? Address Structure: The ISDN address structure is demonstrated in figure. ISDN number part has a maximum

In ldb what determines hierarchy of the tables, In LDB what determines hier...

In LDB what determines hierarchy of the tables? Structure

What is the linkage section, The linkage section is part of a known as prog...

The linkage section is part of a known as program that 'links' or maps to data items in the calling program are working storage. It is the part of the called program where these sh

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd