Pataskar Aniket. - 100+ Java Programs with Output: Useful collection of Java Programs

11. Java Programs part 1 28

class HelloWorld {
public static void main ( String args []) {

import java.util.Scanner ;
class AddTwoMatrix {
public static void main ( String args []) {
Scanner in = new Scanner ( System . in ) ;

System . out . println ( "Enter
the number of rows and
columns of matrix" ) ;

int second [][] = new int [ m ][ n ] ; int sum [][] = new int [ m ][ n ] ;

System . out . println ( "Enter
the elements of first
matrix" ) ;
for ( c = ; c < m ; c ++ )

System . out . println ( Enter the elements of second matrix" ) ;
for ( c = ; c < m ; c ++ )

sum [ c ][ d ] = first [ c ][ d ] + second [ c ]
[ d ] ; //replace '+' with '-' to subtract matrices

System . out . println ( "Sum of entered matrices:-" ) ;
for ( c = ; c < m ; c ++ )

System . out . println () ;
}
}

import java.util.Scanner ;
class BinarySearch {
public static void main ( String args []) {

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

search = in. nextInt () ;
first = ; last = n - ;
middle = ( first + last ) /
;

if ( array [ middle ] < search ) first = middle + ; else if

( array [ middle ] == search ){
System . out . println ( search +
" found at location " +
( middle + ) + "." ) ;
break ; }

last = middle - ;
middle = ( first +
last ) / ;
}
if ( first > last )

}
}
while ( first <= last ) {

Other methods of searching are Linear search andHashing. There is a binarySearch method in Arrays classwhich can also be used.

import java.util.Arrays ;
class BS {
public static void main ( String args [])

{ 'a' , 'b' , 'c' , 'd' , 'e' } ;
System . out . println ( Arrays . bi
narySearch ( characters,
'a' )) ;
System . out . println ( Arrays . bi
narySearch ( characters,
'p' )) ;
}

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 != ) {
% ;
digits ++;

temp = temp / ;
}
temp = n ;
while ( temp != ) {

System . out . println ( n + " is an Armstrong number." ) ;
else

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

Scanner ( System . in ) ;
System . out . println ( "Input
number of integers to
sort" ) ;
n = in. nextInt () ; int array [] = new

for ( d = ; d < n - c
- ; d ++ ) {
if ( array [ d ] >

{
array [ d ] ;
swap =

array [ d ] =
array [ d + ] ;
array [ d + ] = swap ;
}
} }

System . out . println ( "Sorted
list of numbers" ) ;
for ( c = ; c < n ; c ++ )

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