How java tests recursion and loops

This article mainly introduces how java tests recursion and loops, which has a certain reference value, interested friends can refer to, I hope you can learn a lot after reading this article, let the editor take you to understand it.

To test the execution efficiency and system overhead of recursion and loop (in this case, for), we first post an example problem: realizing the Fibonacci sequence F (n) = F (nMul 1) + F (nMel 2).

Test environment Eclipse

1. First of all, we use recursion to achieve it.

Package com.youfeng.test; public class Fab {/ / Recursive public static void main (String [] args) {System.out.println (F (40));} public static Long F (int index) {if (index==1 | | index==2) {return 1L;} else {return F (index-1) + F (index-2);}

two。 Using for loop to realize

Package com.youfeng.test; public class Fab2 {/ / cyclic public static void main (String [] args) {System.out.println (F (40));} public static Long F (int index) {if (index==1 | | index==2) {return 1L;} else {Long f1l; Long f2room1L; Long f1L For (int iTuno Bandi)