02 Monday Sep 2024
The famous Fibonacci sequence starts off [1, 1, 2, 3, 5, 8, 13, 21, …] and continues forever. Each number in the series, except the first two, is the sum of the previous two numbers. For example, 3+5=8.
The canonical algorithm to calculate the series uses recursion and is elegant enough to be a common example of a recursive function. But while elegant conceptually, the algorithm is deadly computationally. In this post I’ll look at several ways to dodge the bullet.
19 Monday Dec 2016
Posted in CS101
Tags
computer language, computer languages, computer programming, computer science, GOTO statement, iteration, language design, loop statements, programming language, recursion
When it comes to what makes a computer (or any other) language a programming language, there are three characteristics usually required:
This post is just a brief note (for a friend) about the third item and why it allows three distinct options.
The Hard-Core Coder 