Demonstration of O(2^n)

A simple demonstration of a recursive function that is O(2^n)

by Ron Eaglin

HTML

<input type='textbox' id='input' /><input type='button' value = 'Do Calculation' onclick='doF();'/>
<div id='output'>

</div>

JavaScript

var count = 0;
function f(n) {
   count++;
   document.getElementById('output').innerHTML += 'Count:' + count + ' n:' + n + "<br/>";
   if (n <= 1) return n;
   return f(n-1) + f(n-1);
}

function doF() {
  var n = document.getElementById('input').value;
  var v = f(n);
  document.getElementById('output').innerHTML += count;
}