/*
* Copyright (c) 2007, 2012, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
package jtt.micro;
/*
* @Harness: java
* @Runs: 0 = 0; 1 = 1; 2 = 1; 3 = 2; 4 = 3; 5 = 5; 6 = 8; 7 = 13
*/
public class Fibonacci {
public static int test(int num) {
if (num <= 0) {
return 0;
}
int n1 = 0;
int n2 = 1;
for (int i = 1; i < num; i++) {
final int next = n2 + n1;
n1 = n2;
n2 = next;
}
return n2;
}
}