Who are stacks and recursion?There basic are operation associated
What happened by stacks and recursion?There are basically used for operation associated with stacks and recursion.
What is a stacks?
Stack is a list of elements in which an element may be inserted or deleted only at one end the top of the stack.
Two basic operation associated with stacks:-
✍️"Push" is the term used to insert an element into a stack.
✍️"Pop" is the term used to delete an element from a stack.
What is a recursion?
Recursion is an important concept in computer science.Many algorithms can be best described in terms of recursion. Recursion may be implemented by means of stacks.
Recursive procedure must have the following two properties:-
✍️There must be certain called base criteria for which the procedure doesn't call itself.
✍️Each time the procedure does call itself (directly or indirectly)it must be closer to the base criteria.
Recursive defined by it must have the following two properties:-
✍️There must be certain argument called base value for which the function does not refer to itself.
✍️Each time the function does refer to itself the argument of the function must be closer to a base value.
A recursive function with these two properties is also said to be well defined.
KDSD Fun and
Marvel Arkman
Comments
Post a Comment