Java basic codes

1) Program to print alphabets both in small and

capital
public class Alphabets {
public static void main(String args[]){
char ch;
System.out.println("Small Alphabets: ");
for( ch = 'a' ; ch <= 'z' ; ch++ ){
System.out.println(ch);
}

System.out.println("Capital Alphabets: ");

for( ch = 'A' ; ch <= 'Z' ; ch++ ){
System.out.println(ch);
}
}
}

Printing alphabets using while loop (only body of main method is shown):

char c = 'a';

while (c <= 'z') {

System.out.println(c);
c++;
}

Using do while loop:

char c = 'A';

do {
System.out.println(c);
c++;
} while (c <= 'Z');

Example 1 b: Print integers

public class Integers {

public static void main(String[] arguments) {
int c; //declaring a variable
 /* Using for loop to repeat instruction execution */

for (c = 1; c <= n; c++) {

System.out.println(c);
}
}
}
[n=1,2,3,4,5,6………….n]

2) Java program to find factorial

import java.util.Scanner;

public class Factorial

{
public static void main(String args[])
{
int n, c, fact = 1;

System.out.println("Enter an integer to calculate it's factorial");

Scanner in = new Scanner(System.in);

n = in.nextInt();

if ( n < 0 )
System.out.println("Number should be non-negative.");
else
{
for ( c = 1 ; c <= n ; c++ )
fact = fact*c;

System.out.println("Factorial of "+n+" is = "+fact);

}
}
}

3) Java program print prime numbers

import java.util.*;

public class PrimeNumbers

{
public static void main(String args[])
{
int n, status = 1, num = 3;

Scanner in = new Scanner(System.in);

System.out.println("Enter the number of prime numbers you want");
n = in.nextInt();
 if (n >= 1)
{
System.out.println("First "+n+" prime numbers are :-");
System.out.println(2);
}

for ( int count = 2 ; count <=n ; )

{
for ( int j = 2 ; j <= Math.sqrt(num) ; j++ )
{
if ( num%j == 0 )
{
status = 0;
break;
}
}
if ( status != 0 )
{
System.out.println(num);
count++;
}
status = 1;
num++;
}
}
}

4) Java program to reverse a string

import java.util.*;

public class ReverseString

{
public static void main(String args[])
{
String original, reverse = "";
Scanner in = new Scanner(System.in);

System.out.println("Enter a string to reverse");

original = in.nextLine();

int length = original.length();

for ( int i = length - 1 ; i >= 0 ; i-- )

reverse = reverse + original.charAt(i);

System.out.println("Reverse of entered string is: "+reverse);

}
}
 5) Reverse string using StringBuffer class
public class InvertString
{
public static void main(String args[])
{
StringBuffer a = new StringBuffer("Java programming is fun");
System.out.println(a.reverse());
}
}

6) Java program to reverse number

import java.util.Scanner;

class ReverseNumber
{
public static void main(String args[])
{
int n, reverse = 0;

System.out.println("Enter the number to reverse");

Scanner in = new Scanner(System.in);
n = in.nextInt();

while( n != 0 )
{
reverse = reverse * 10;
reverse = reverse + n%10;
n = n/10;
}

System.out.println("Reverse of entered number is "+reverse);

}
}

7) Java program to check palindrome("mom", "madam")

import java.util.*;

public class Palindrome

{
public static void main(String args[])
{
String original, reverse = "";
Scanner in = new Scanner(System.in);

System.out.println("Enter a string to check if it is a palindrome");

original = in.nextLine();

int length = original.length();

for ( int i = length - 1; i >= 0; i-- )

 reverse = reverse + original.charAt(i);

if (original.equals(reverse))
System.out.println("Entered string is a palindrome.");
else
System.out.println("Entered string is not a palindrome.");

}
}

8) Java program to check armstrong number (Armstrong

number is a number which is equal to sum of digits raise to the power
total number of digits in the number. Some Armstrong numbers are: 0, 1,
4, 5, 9, 153, 371, 407, 8208 etc.)

import java.util.Scanner;

public class ArmstrongNumber

{
public static void main(String args[])
{
int n, sum = 0, temp, remainder, digits = 0;

Scanner in = new Scanner(System.in);

System.out.println("Input a number to check if it is an Armstrong
number");
n = in.nextInt();

temp = n;

// Count number of digits

while (temp != 0) {
digits++;
temp = temp/10;
}

temp = n;

while (temp != 0) {
remainder = temp%10;
sum = sum + power(remainder, digits);
temp = temp/10;
}

if (n == sum)
System.out.println(n + " is an Armstrong number.");
else
System.out.println(n + " is not an Armstrong number.");
}

static int power(int n, int r) {

int c, p = 1;
 for (c = 1; c <= r; c++)
p = p*n;

return p;
}
}

9) Java program to compare two strings

import java.util.Scanner;

class CompareStrings
{
public static void main(String args[])
{
String s1, s2;
Scanner in = new Scanner(System.in);

System.out.println("Enter the first string");

s1 = in.nextLine();

System.out.println("Enter the second string");

s2 = in.nextLine();

if ( s1.compareTo(s2) > 0 )
System.out.println("First string is greater than second.");
else if ( s1.compareTo(s2) < 0 )
System.out.println("First string is smaller than second.");
else
System.out.println("Both strings are equal.");
}
}

10) Java program to find odd or even

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("You entered an even number.");
 else
System.out.println("You entered an odd number.");
}
}

11) Swapping using temporary or third variable

import java.util.Scanner;

class SwapNumbers
{
public static void main(String args[])
{
int x, y, temp;
System.out.println("Enter 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);

}
}

12) Swapping without temporary variable

import java.util.Scanner;

class SwapNumbers
{
public static void main(String args[])
{
int x, y;
System.out.println("Enter x and y");
Scanner in = new Scanner(System.in);

x = in.nextInt();
y = in.nextInt();

System.out.println("Before Swapping\nx = "+x+"\ny = "+y);

x = x + y;
y = x - y;
x = x - y;

System.out.println("After Swapping\nx = "+x+"\ny = "+y);

 }
}

13) Java program to find largest of three numbers

import java.util.Scanner;

class LargestOfThreeNumbers
{
public static void main(String args[])
{
int x, y, z;
System.out.println("Enter three integers ");
Scanner in = new Scanner(System.in);

x = in.nextInt();
y = in.nextInt();
z = in.nextInt();

if ( x > y && x > z )

System.out.println("First number is largest.");
else if ( y > x && y > z )
System.out.println("Second number is largest.");
else if ( z > x && z > y )
System.out.println("Third number is largest.");
else
System.out.println("Entered numbers are not distinct.");
}
}

14) Java program to get ip address

import java.net.InetAddress;

class IPAddress
{
public static void main(String args[]) throws Exception
{
System.out.println(InetAddress.getLocalHost());
}
}

15) Java enhanced for loop integer array

class EnhancedForLoop {
public static void main(String[] args) {
int primes[] = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29};

for (int t: primes) {

System.out.println(t);
}
}
}
 16) Java enhanced for loop strings
class EnhancedForLoop {
public static void main(String[] args) {
String languages[] = { "C", "C++", "Java", "Python", "Ruby"};

for (String sample: languages) {

System.out.println(sample);
}
}
}

17) Java program to print Floyd's triangle

import java.util.Scanner;

class FloydTriangle
{
public static void main(String args[])
{
int n, num = 1, c, d;
Scanner in = new Scanner(System.in);

System.out.println("Enter the number of rows of floyd's triangle you

want");
n = in.nextInt();

System.out.println("Floyd's triangle :-");

for ( c = 1 ; c <= n ; c++ )

{
for ( d = 1 ; d <= c ; d++ )
{
System.out.print(num+" ");
num++;
}

System.out.println();
}
}
}

18) Java program to display date and time, print date and
time using java program
import java.util.*;

class GetCurrentDateAndTime
{
public static void main(String args[])
{
int day, month, year;
int second, minute, hour;
 GregorianCalendar date = new GregorianCalendar();

day = date.get(Calendar.DAY_OF_MONTH);
month = date.get(Calendar.MONTH);
year = date.get(Calendar.YEAR);

second = date.get(Calendar.SECOND);
minute = date.get(Calendar.MINUTE);
hour = date.get(Calendar.HOUR);

System.out.println("Current date is "+day+"/"+(month+1)+"/"+year);

System.out.println("Current time is "+hour+" : "+minute+" : "+second);
}
}

19) Java program to print multiplication table

import java.util.Scanner;

public class MultiplicationTable

{
public static void main(String args[])
{
int n, c;
System.out.println("Enter an integer to print it's multiplication
table");
Scanner in = new Scanner(System.in);
n = in.nextInt();
System.out.println("Multiplication table of "+n+" is :-");

for ( c = 1 ; c <= 10 ; c++ )

System.out.println(n+"*"+c+" = "+(n*c));
}
}

20) Java program for linear search

import java.util.Scanner;

class LinearSearch
{
public static void main(String args[])
{
int c, n, search, array[];

Scanner in = new Scanner(System.in);

System.out.println("Enter number of elements");
n = in.nextInt();
array = new int[n];
 System.out.println("Enter " + n + " integers");

for (c = 0; c < n; c++)

array[c] = in.nextInt();

System.out.println("Enter value to find");

search = in.nextInt();

for (c = 0; c < n; c++)

{
if (array[c] == search) /* Searching element is present */
{
System.out.println(search + " is present at location " + (c + 1) +
".");
break;
}
}
if (c == n) /* Searching element is absent */
System.out.println(search + " is not present in array.");
}
}

21) Java program for binary search

import java.util.Scanner;

class BinarySearch
{
public static void main(String args[])
{
int c, first, last, middle, n, search, array[];

Scanner in = new Scanner(System.in);

System.out.println("Enter number of elements");
n = in.nextInt();
array = new int[n];

System.out.println("Enter " + n + " integers");

for (c = 0; c < n; c++)

array[c] = in.nextInt();

System.out.println("Enter value to find");

search = in.nextInt();

first = 0;
last = n - 1;
middle = (first + last)/2;

while( first <= last )

{
if ( array[middle] < search )
first = middle + 1;
else if ( array[middle] == search )
 {
System.out.println(search + " found at location " + (middle + 1) +
".");
break;
}
else
last = middle - 1;

middle = (first + last)/2;

}
if ( first > last )
System.out.println(search + " is not present in the list.\n");
}
}

22) Java program to bubble sort

import java.util.Scanner;

class BubbleSort {
public static void main(String []args) {
int n, c, d, swap;
Scanner in = new Scanner(System.in);

System.out.println("Input number of integers to sort");

n = in.nextInt();

int array[] = new int[n];

System.out.println("Enter " + n + " integers");

for (c = 0; c < n; c++)

array[c] = in.nextInt();

for (c = 0; c < ( n - 1 ); c++) {

for (d = 0; d < n - c - 1; d++) {
if (array[d] > array[d+1]) /* For descending order use < */
{
swap = array[d];
array[d] = array[d+1];
array[d+1] = swap;
}
}
}

System.out.println("Sorted list of numbers");

for (c = 0; c < n; c++)

System.out.println(array[c]);
}
}