Using Clojure to Generate Java to Reimplement Clojure

Most data structures are designed to hold arbitrary amounts of data. When we talk about their complexity in time and space, we use big O notation, which is only concerned with performance characteristics as n grows arbitrarily large. Understanding how to …


Nth Fibonacci Number Using Java Recursion

There are certain problems that just make sense to solve using Java Recursion. Demonstrating Fibonacci Series is one of them. Let’s take a look at something called Fibonacci series. Here are the first few numbers of this series:0, 1, 1, 2, 3, 5, 8, 13, 21... (more…)

Read more »