Recursion, PL-SQL Programming


The Recursion is a powerful method for simplify the design of the algorithms. Principally, the recursion means the self-reference. In the recursive mathematical series, each word is derived by applying the formula to the preceding terms. The Fibonacci series (1, 1, 2, 3, 5, 8, 13, 21, ...), that was first used to model the growth of the rabbit colony, is an example. Each word in the series (after the second) is the sum of the two terms that instantly precede it.

In a recursive description, somewhat is defined in terms of the simpler versions of itself.

Consider the definition of n factorial (n!), that the product of all integers from 1 to n:

n! = n * (n - 1)!

Posted Date: 10/5/2012 5:46:28 AM | Location : United States

Related Discussions:- Recursion, Assignment Help, Ask Question on Recursion, Get Answer, Expert's Help, Recursion Discussions

Write discussion on Recursion
Your posts are moderated
Related Questions
Project Description: We organize an online system called ACPAS we have created a project called EVO that can be use by our customers to integrate their web sites with the Acpas

Map and Order Methods: The values of the scalar datatype like CHAR or REAL have a predefined order that allows them to be compared. While, the instances of an object type has

#quesWrite a cursor to open an employee database and fetch the employee record whose age is greater than 45.tion..

Using Operator DEREF: You cannot navigate through refs within the PL/SQL procedural statements. Rather than, you should use the operator DEREF in the SQL statement. The DEREF

Truth Tables: However in propositional logic - here we are restricted to expressing sentences and where the propositions are true or false - so we can check where a particular

Functions   The function is a subprogram that calculates a value. The Functions and procedures are structured similar, except that the functions have a RETURN clause. You can

Effects of NULL for Table Expression Here's an important distinction between expressions denoting tables and expressions denoting multisets of rows: a table expression cannot

When Are Constraints Checked Under the model constraints are conceptually checked at all statement boundaries (and only at statement boundaries). By default the same is true

Dynamic SQL: The Most PL/SQL programs do a predictable, specific job. For illustration, a stored procedure may accept an employee number and salary increase, and then update t

Using a join on 2 tables, select all columns and 10 rows from the 2 tables without the use of a Cartesian product. Query: SELECT * FROM EMPLOYEE1 E JOIN STAFF S ON E.EMP_