Java’s Binary Search Madness

We all love binary search.
Straightforward, easy to understand algorithm; finds your number in a sorted array
in an appealing O(log n) time. But is it that simple to implement? Read more

Similar

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 »