This program finds the Nth Fibonacci number using dynamic programming approach. Dynamic programming is an efficient algorithmic technique that involves breaking down a problem into smaller ...

This program calculates the nth Fibonacci number in O(log(n)). It's possible to calculate F(1_000_000) in less than a second.