GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — Java/Maths/LucasSeries.java at master · tmluwei/Java Expand file tree/ Copy pathLucasSeries.javaMore file actions 43 lines (40 loc) · 1.3 KB / Copy pathLucasSeries.javaFile metadata and controls43 lines (40 loc) · 1.3 KB 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 package Maths; /** https://en.wikipedia.org/wiki/Lucas_number */ public class LucasSeries { public static void main(String[] args) { assert lucasSeries(1) == 2 && lucasSeriesIteration(1) == 2; assert lucasSeries(2) == 1 && lucasSeriesIteration(2) == 1; assert lucasSeries(3) == 3 && lucasSeriesIteration(3) == 3; assert lucasSeries(4) == 4 && lucasSeriesIteration(4) == 4; assert lucasSeries(5) == 7 && lucasSeriesIteration(5) == 7; assert lucasSeries(6) == 11 && lucasSeriesIteration(6) == 11; assert lucasSeries(11) == 123 && lucasSeriesIteration(11) == 123; } /** * Calculate nth number of lucas series(2, 1, 3, 4, 7, 11, 18, 29, 47, 76, 123, ....) using * recursion * * @param n nth * @return nth number of lucas series */ public static int lucasSeries(int n) { return n == 1 ? 2 : n == 2 ? 1 : lucasSeries(n - 1) + lucasSeries(n - 2); } /** * Calculate nth number of lucas series(2, 1, 3, 4, 7, 11, 18, 29, 47, 76, 123, ....) using * iteration * * @param n nth * @return nth number of lucas series */ public static int lucasSeriesIteration(int n) { int previous = 2; int current = 1; for (int i = 1; i < n; i++) { int next = previous + current; previous = current; current = next; } return previous; } } |
| You are visitor 01402520 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |