/* Created by: Andrew Cook Includes Modified code by Kalia Thornton Includes Modified code by Jordan Messec; June 25, 2014 */ import java.io.File; import java.io.FileNotFoundException; import java.util.ArrayList; import java.util.Scanner; public class Debugging { public static String ERR1 = "An assert failed! Program dies screaming."; public static String outOfBounds(ArrayList list) { return list.get(0); } public static boolean equalsCS161(String input) { return input.equals("CS161"); } public static void readFile(String fileName) { try { Scanner input = new Scanner(new File(fileName)); input.close(); } catch (FileNotFoundException fnfe) { fnfe.printStackTrace(); } } public static void assertTest() { int sum = 0; for(int c = 0; c < 10; c++) { sum -= c; } System.out.println(sum); //comment these in and play with them. //assert (sum > 0); //assert (sum > 0) : ERR1; } public static int fibonacci(int i) { if(i == 0) return 0; if(i == 1) return 1; int previous1 = 1; int previous2 = 0; int number = 0; for(int c = 2; c <= i; c++) { number = previous1 + previous2; previous2 = previous1; previous1 = number; } return number; } public static void main(String[] args) { //ArrayList holder = new ArrayList(); //System.out.println(outOfBounds(holder)); // String temp = null; // if(equalsCS161(temp)) // { // System.out.println("Temp equals CS161"); // } // else // { // System.out.println("Temp does not equal CS161"); // } // readFile("text.txt"); // assertTest(); // for(int c = 0; c < 100; c++) // { // System.out.println(c+ ": " + fibonacci(c)); // } } }