# Fibonacci Numbers in Java - \`O(n)\` time and \`O(1)\` space complexity and without using Recursion

**URL:** <https://discourse.processing.org/t/fibonacci-numbers-in-java-o-n-time-and-o-1-space-complexity-and-without-using-recursion/32694>\
**Category:** Coding Questions\
**Created:** [October 8, 2021, 12:58pm UTC](https://discourse.processing.org/t/fibonacci-numbers-in-java-o-n-time-and-o-1-space-complexity-and-without-using-recursion/32694 "2021-10-08T12:58:18Z")\
**Posts on this page:** 1\
**Showing post:** 2

<div class="post-metadata">

**Author:** ![jb4x](https://yyz2.discourse-cdn.com/flex036/user_avatar/discourse.processing.org/jb4x/32/789_2.png) [@jb4x](https://discourse.processing.org/u/jb4x)\
**Post date:** [October 8, 2021, 4:14pm UTC](https://discourse.processing.org/t/fibonacci-numbers-in-java-o-n-time-and-o-1-space-complexity-and-without-using-recursion/32694/2 "2021-10-08T16:14:19Z")

</div>

Can you please merge your 2 threads?

> [@Fibonacci Numbers in Java](https://discourse.processing.org/t/fibonacci-numbers-in-java/32693):
>
> I started reading about Fibonacci Numbers in Java and was curious to know from this community about - What are the ways we can print Fibonacci Numbers in Java?

---

_[View the full topic](https://discourse.processing.org/t/fibonacci-numbers-in-java-o-n-time-and-o-1-space-complexity-and-without-using-recursion/32694)._