After browsing the internet for some time looking for a quick example of a queue implementation in C, I was shocked to find that most implementations or examples that I found online were somewhat lousy. So, for illustration purpouses I decided to implement a "wrap-around" queue written in C. I'll let you be the judge as to wether it is just as lousy as any other implementation you find on the net.
Fibonacci Numbers are a sequence of numbers along the diagnoal of Pascal's Triangle.
Often in Computer Science the Fibonacci Sequence is used to teach recursion. Many CS students get confused at the idea of a recursive sequence generating seemingly random numbers, but the Fibonacci Sequence is actually a lot simplier than commonly thought.
For our pourpouses, we can think of the Fibonacci Sequence as being summed up into a simple equation: