Recursion & Stack: Conceptual Study for Implementation of Stack in Recursion

  • Unique Paper ID: 157302
  • Volume: 9
  • Issue: 6
  • PageNo: 464-480
  • Abstract:
  • This paper describes the detailed conceptual study of implementation of Stack Data structure in Recursion. In computer science, recursion is a programming technique which uses function or algorithm that invokes itself. Stack is a LIFO data structure in that Item is pushed & popped at same place named Top of Stack. A Recursive Program always uses stack to store the result of calculation made inside recursive procedure.

Copyright & License

Copyright © 2025 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

BibTeX

@article{157302,
        author = {P. K. Tyagi and Pankaj Kumar Gupta},
        title = {Recursion & Stack: Conceptual Study for Implementation of Stack in Recursion},
        journal = {International Journal of Innovative Research in Technology},
        year = {},
        volume = {9},
        number = {6},
        pages = {464-480},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=157302},
        abstract = {This paper describes the detailed conceptual study of implementation of Stack Data structure in Recursion. In computer science, recursion is a programming technique which uses function or algorithm that invokes itself. Stack is a LIFO data structure in that Item is pushed & popped at same place named Top of Stack. A Recursive Program always uses stack to store the result of calculation made inside recursive procedure.},
        keywords = {Recursion, Stack, LIFO. },
        month = {},
        }

Cite This Article

  • ISSN: 2349-6002
  • Volume: 9
  • Issue: 6
  • PageNo: 464-480

Recursion & Stack: Conceptual Study for Implementation of Stack in Recursion

Related Articles