Loops, Recursion and Memoization in JavaScript

July 25, 2013 · 1 min read

According to Wikipedia, the factorial of a positive integer n (denoted by n!) is the product of all positive integers less than or equal to n.

For example, 5! = 5 x 4 x 3 x 2 x 1 = 120.

The value of 0! is 1.

We can use factorials to demonstrate iterative loops and recursive functions in JavaScript.  Here is a function that computes the factorial using a for loop:

factorial iterative 329985280

Output:

Time Taken: 51 ms

Here is the factorial function coded to be called recursively:

factorial recursive 2107547840

Output:

Time Taken: 165 ms

We can speed up the recursive function with the use of memoization.  Hence,  if the value has previously been computed, it is simply returned and the recursive call ends.

factorial memoize 1433027904

Output:

Time Taken: 17 ms

This article is part of the GWB Archives. Original Author: Ken Dason

New on Geeks with Blogs

  • We Won The One Award I Actually Care About

    Full Scale made the Inc. 5000 for the fifth year straight, the 12th listing across my three companies. Here is why the one award you cannot buy is worth stopping for.

  • Your Customers Build the Features Now

    I let a tool I liked sit dead for a year rather than build the features I wanted. An MCP server meant I never had to, and your customers can do the same to your product.

  • Get the Size of a Directory in Linux the Easy Way

    du -sh for the quick answer, ncdu for the cleanup, df for the disk itself: every command for checking directory size in Linux, plus why du and df never agree.

  • Vim Search and Replace: The Ultimate Guide

    One :%s command replaces every match in a file before a find dialog would even open. The Vim substitute patterns worth the muscle memory: flags, ranges, capture groups, and multi-file edits.