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.
What is Ackermann Function?
Ackermann Function: The Ackermann function is a function with two arguments each of which can be assigned any nonnegative integer: 0, 1, 2,........... This function is defined as follows:
(a) If m = 0 , then A… Read More
POP(STACK, TOP, ITEM): This procedure deletes the top element of STACK and assigns it to the variable ITEM
1. [Stack has an ITEM to be remove?]
If TOP = 0, then: Print:… 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 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 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 More
Posts
0 comments:
Post a Comment