1// Copyright 2008 the V8 project authors. All rights reserved. 2// Redistribution and use in source and binary forms, with or without 3// modification, are permitted provided that the following conditions are 4// met: 5// 6// * Redistributions of source code must retain the above copyright 7// notice, this list of conditions and the following disclaimer. 8// * Redistributions in binary form must reproduce the above 9// copyright notice, this list of conditions and the following 10// disclaimer in the documentation and/or other materials provided 11// with the distribution. 12// * Neither the name of Google Inc. nor the names of its 13// contributors may be used to endorse or promote products derived 14// from this software without specific prior written permission. 15// 16// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 17// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 18// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 19// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 20// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 21// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 22// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 23// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 24// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 25// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 26// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 27 28// Flags: --gc-greedy 29 30function IterativeFib(n) { 31 var f0 = 0, f1 = 1; 32 for (; n > 0; --n) { 33 var f2 = f0 + f1; 34 f0 = f1; f1 = f2; 35 } 36 return f0; 37} 38 39function RecursiveFib(n) { 40 if (n <= 1) return n; 41 return RecursiveFib(n - 1) + RecursiveFib(n - 2); 42} 43 44function Check(n, expected) { 45 var i = IterativeFib(n); 46 var r = RecursiveFib(n); 47 assertEquals(i, expected); 48 assertEquals(r, expected); 49} 50 51Check(0, 0); 52Check(1, 1); 53Check(2, 1); 54Check(3, 1 + 1); 55Check(4, 2 + 1); 56Check(5, 3 + 2); 57Check(10, 55); 58Check(15, 610); 59Check(20, 6765); 60assertEquals(IterativeFib(75), 2111485077978050); 61