Commit 5bf5fed

committed

Fibonacci Series

1 parent e771236 commit 5bf5fedCopy full SHA for 5bf5fed

File tree

+48

-3

lines changed

+48

-3

lines changed

Lines changed: 45 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,45 @@`
	`1`	`+package com.java.series;`
	`2`	`+`
	`3`	`+/*`
	`4`	`+ * Fibonacci Series`
	`5`	`+ * ----------------`
	`6`	`+ * In mathematics, the Fibonacci numbers,`
	`7`	`+ * commonly denoted Fn, form a sequence,`
	`8`	`+ * called the Fibonacci sequence, such that`
	`9`	`+ * each number is the sum of the`
	`10`	`+ * two preceding ones, starting from 0 and 1.`
	`11`	`+ *`
	`12`	`+ * In other words, the previous two numbers`
	`13`	`+ * are added to get the next number, starting from 0 & 1.`
	`14`	`+ *`
	`15`	`+ * The Fibonacci Sequence is the series`
	`16`	`+ * of numbers: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, ...`
	`17`	`+ *`
	`18`	`+ */`
	`19`	`+`
	`20`	`+public class FibonacciSeries {`
	`21`	`+ public static void main(String[] args) {`
	`22`	`+ int N = 10;`
	`23`	`+ int num1 = 0;`
	`24`	`+ int num2 = 1;`
	`25`	`+`
	`26`	`+ System.out.println("Fibonacci series N="+N);`
	`27`	`+ System.out.print(num1+" "+num2);`
	`28`	`+ int i = 2;`
	`29`	`+ while(i <= N){`
	`30`	`+ i++;`
	`31`	`+ int temp = num1+num2;`
	`32`	`+ num1 = num2;`
	`33`	`+ num2 = temp;`
	`34`	`+ System.out.print(" "+num2);`
	`35`	`+ }`
	`36`	`+ }`
	`37`	`+}`
	`38`	`+/*`
	`39`	`+ OUTPUT`
	`40`	`+ Fibonacci series N=15`
	`41`	`+ 0 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610`
	`42`	`+`
	`43`	`+ Fibonacci series N=10`
	`44`	`+ 0 1 1 2 3 5 8 13 21 34 55`
	`45`	`+*/`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -37,7 +37,7 @@ private static boolean checkPalindrome(String str){`
`37`	`37`	`//then compare index 1 with index (n-2)`
`38`	`38`	`//do this comparison for half of the string,`
`39`	`39`	`//if is palindrome 2nd half the string is mirror(reverse) of the 1st half`
`40`		`- for(int i=0;i<str.length()/2;i++)`
	`40`	`+ for(int i=0;i < str.length()/2;i++)`
`41`	`41`	`if(str.charAt(i) != str.charAt(strLen-i-1))`
`42`	`42`	`return false;`
`43`	`43`	`return true;`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -28,7 +28,7 @@ public static void main(String[] args) {`
`28`	`28`	`public static void permutation(String p,String s){`
`29`	`29`	`if(s.length() == 0)`
`30`	`30`	`System.out.println(p);`
`31`		`- for(int i=0;i<s.length();i++){`
	`31`	`+ for(int i=0;i < s.length();i++){`
`32`	`32`	`permutation(p+s.charAt(i), s.substring(0, i)+s.substring(i+1));`
`33`	`33`	`}`
`34`	`34`	`}`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -36,7 +36,7 @@ public static void main(String[] args) {`
`36`	`36`	`public static String reverseString(String str){`
`37`	`37`	`char[] charArray = str.toCharArray();`
`38`	`38`	`int j = charArray.length-1;`
`39`		`- for(int i=0;i<charArray.length/2;i++,j--){`
	`39`	`+ for(int i=0 ;i < charArray.length/2;i++,j--){`
`40`	`40`	`char temp = charArray[i];`
`41`	`41`	`charArray[i] = charArray[j];`
`42`	`42`	`charArray[j] = temp;`

Comments

(0)