---
title: "Discussion on \"Emulating the call stack in Java\" | Hashnode"
description: "Discussion on \"Emulating the call stack in Java\". The setup\nI was recently thinking about the challenges in converting any given recursive algorithm into an iterative one. Famous problems like finding the n'th number in the Fibonacci series have recursive as well as non-recursive/iterative solutions..."
url: "https://hashnode.com/posts/emulating-the-call-stack-in-java/60aa2a6f20d1f45ceb7ef6c5"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Emulating the call stack in Java](https://rahulchhiber.hashnode.dev/emulating-the-call-stack-in-java?utm_source=hashnode&utm_medium=feed)

The setup I was recently thinking about the challenges in converting any given recursive algorithm into an iterative one. Famous problems like finding the n'th number in the Fibonacci series have recursive as well as non-recursive/iterative solutions...

May 23, 2021 · 5 min read · rahulchhiber.hashnode.dev  
Read the article

-   [#data-structures](https://hashnode.com/tag/data-structures)
-   [#algorithms](https://hashnode.com/tag/algorithms)
-   [#recursion](https://hashnode.com/tag/recursion)
-   [#stack](https://hashnode.com/tag/stack)
-   [#computer-science](https://hashnode.com/tag/computer-science)

## Written by

[Rahul Chhiber](https://hashnode.com/@copperfield)

@copperfield

  
[View profile](https://hashnode.com/@copperfield)

Software Engineer

## Responses

Markdown supported · ⌘↵ to post

No responses yet.