Fibonacci Series in Java
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 |
public class Fibonacci { public static void main(String[] args) { //0 1 1 2 3 5 8... int[] fibonacciNumbers = new int[25]; fibonacciNumbers[0] = 0; fibonacciNumbers[1] = 1; for (int i = 0; i < fibonacciNumbers.length-2 ; i++) { fibonacciNumbers[i+2] = fibonacciNumbers[i] + fibonacciNumbers[i+1]; } for (int i = 0; i < fibonacciNumbers.length; i++) { System.out.print(fibonacciNumbers[i] + ", "); } } } |
Palindrome Numbers in Java
|
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 |
public class Palindrome { public static void main(String[] args) { // TODO Auto-generated method stub String orginalText = "dad"; String reverseText = ""; for(int i = orginalText.length(); i > 0; i-- ){ reverseText = reverseText + orginalText.charAt(i-1); } if(reverseText.equals(orginalText)){ System.out.println("This word is polindrome"); }else{ System.out.println("This word isn't polindrome"); } } } |
Prime Numbers in Java
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 |
public class PrimeNumber { public static void main(String[] args) { System.out.println("This number is " + (isPrimeNumber(6) ? "prime" : "not prime")); } private static Boolean isPrimeNumber(int number){ Boolean flag = Boolean.TRUE; for (int i = number-1; i > 2; i--) { if(number%i == 0){ flag = Boolean.FALSE; break; } } return flag; } } |
