This page contains the collection of Java programming code examples which helps you to learn java programming language. Below are some basic java programs with the output.
1. Java Program to Swap Numbers
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 |
import java.util.Scanner; class SwapNumberProgram { public static void main(String args[]) { int x, y, temp; System.out.println("Enter number x and y"); Scanner in = new Scanner(System.in); x = in.nextInt(); y = in.nextInt(); System.out.println("Before Swapping\nx = "+x+"\ny = "+y); temp = x; x = y; y = temp; System.out.println("After Swapping\nx = "+x+"\ny = "+y); } } |
2. Odd Even Program in Java
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 |
import java.util.Scanner; class OddOrEven { public static void main(String args[]) { int x; System.out.println("Enter an integer to check if it is odd or even:"); Scanner in = new Scanner(System.in); x = in.nextInt(); if ( x % 2 == 0 ) System.out.println("This is a Even number."); else System.out.println("This is a Odd number."); } } |
3. Palindrome Program in Java
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 |
class PalindromeExample { public static void main(String args[]) { int r,sum=0,temp; int n=454; temp=n; while(n>0){ r=n%10; //getting remainder sum=(sum*10)+r; n=n/10; } if(temp==sum) System.out.println("This is a Palindrome Number."); else System.out.println("This is not a Palindrome Nunmber."); } } |
4. Fibonacci Series Program in Java
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 |
class FibonacciNumber{ public static void main(String args[]) { int n1=0,n2=1,n3,i,count=10; System.out.print(n1+" "+n2);//printing 0 and 1 for(i=2;i<count;++i)//loop starts from 2 because 0 and 1 are already printed { n3=n1+n2; System.out.print(" "+n3); n1=n2; n2=n3; } }} |
5. Prime Number Program in Java
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 |
public class PrimeNumberExample{ public static void main(String args[]){ int i,m=0,flag=0; int number=11;//it is the number to be checked m=number/2; if(number==0||number==1){ System.out.println(number+" is not prime number"); }else{ for(i=2;i<=m;i++){ if(number%i==0){ System.out.println(number+" is not prime number"); flag=1; break; } } if(flag==0) { System.out.println(number+" is prime number"); } }//end of else } } |
6. Binary Search Program 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 26 27 28 29 |
class BinarySearchExample1 { public static int binarySearch(int arr[], int first, int last, int key){ if (last>=first){ int mid = first + (last - first)/2; if (arr[mid] == key){ return mid; } if (arr[mid] > key){ return binarySearch(arr, first, mid-1, key);//search in left subarray }else{ return binarySearch(arr, mid+1, last, key);//search in right subarray } } return -1; } public static void main(String args[]){ int arr[] = {10,20,30,40,50,60,70}; int key = 70; int last=arr.length-1; int result = binarySearch(arr,0,last,key); if (result == -1){ System.out.println("Element is not found!"); } else{ System.out.println("Element is found at index: "+result); } } } |
7. Java program to print all prime factors
|
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 |
import java.io.*; import java.lang.Math; class primeFactorsProgram { public static void primeFactors(int n) { while (n%2==0) { System.out.print(2 + " "); n /= 2; } for (int i = 3; i <= Math.sqrt(n); i+= 2) { while (n%i == 0) { System.out.print(i + " "); n /= i; } } if (n > 2) System.out.print(n); } public static void main (String[] args) { int n = 315; primeFactors(n); } } |
Do you like & share this article with your friends, and don’t forget to follow us on Facebook and Twitter to learn cool tutorials.
If you like FreeWebMentor and you would like to contribute, you can write an article and mail your article to [email protected] Your article will appear on the FreeWebMentor main page and help other developers.
