通过斐波那契数列来比较递归和迭代的区别

import java.io.File;import java.io.FileInputStream;import java.io.IOException;import java.text.SimpleDateFormat;import java.util.Calendar;import java.util.Scanner;public class Test {private static int k = 1;static int iterete(int n){if(n==1||n==0){return 1;}return iterete(n-1)+iterete(n-2);}static int enurm(int n){int head =1;int tail=1;int next=0;if(n==1||n==0){return 1;}for(int j=2;j<=n;j++){next=tail+head;head=tail;tail=next;}return next;}public static void main(String[] args) throws IOException {String s="ab";String s1="ab";String s2="ab1";int i=2;int j=2;System.out.println(i==j);String s3 =new String("ab1");System.out.println(""+s==s1);System.out.println(""+s.equals(s1));System.out.println(""+s2==s3);System.out.println(""+s2.equals(s3));int n=4;System.out.println("递归"+iterete(n));System.out.println();System.out.println("迭代"+enurm(n));}}