Data Structure, Data, Data Information, Programming, Coading, Algorithm,Linked,List,Tree,Sorting,Searching,Complexity,String, Stack,Queues,Recursion, Polish Notation,Ackermann Function, Tower of Hanoi,Graph, Shortest Path Algorithm, Warshall's.
Example Of Factorial Function
Example Of Factorial Function: n! = 1.2.3...............(n-2)(n-1)n
0! = 1 1! = 1 2! = 1.2 = 2 &… Read MorePUSH(STACK, TOP, MAXSTK, ITEM)
PUSH(STACK, TOP, MAXSTK, ITEM): This procedure pushes an ITEM onto a stack.
1. [Stack already filled?]
If TOP = MAXSTK, then: Print:OVERFLOW, and return.
2. Set … Read MoreFIBONACCI(FIB, N)
FIBONACCI(FIB, N)
This procedure calculates FN and returns the value in the first parameter FIB.
1. If N = 0 or N = 1, then : Set FIB : = N, and return.
2. Call FIBONACCI(FIBA, N-2).
3. Call FIBONACCI(FIBB, N-1… Read MoreWhat is Recursion?
Recursion: A recursive must have two proprties
(a) There must be certain criteria, called base criteria, for which the procedure does not call itself.
(b) Each time the procedure does call itself (di… Read MoreFACTORIAL(FACT, N)
Procedure A: FACTORIAL(FACT, N)
This procedure calculate N! and returns the value in the variable FACT.
1. If N = 0, then:Set FACT : = 1, and return.
2. Set FACT : = 1. [Initializes FACT for loo.]
3. Re… Read More
Posts
0 comments:
Post a Comment