ARRAYS

------cONTINOUS COLLECTION OF SAME TYPE OF DATA.

Why Arrays?
Arrays are continous in nature hence create
continous memory which can be accessed faster as compared to variables
as variables are created on random locations in the memory.
types of arrays:
a) ONE DIMENSIONAL ARRAY
b) TWO DIMENSIONAL/MULTI-DIMENSIONAL ARRAY
1-D ARRAYS
---------int a[]=new int[5];
This will create an array "a" having 5 continous memory locations.
//PROGRAM TO INPUT 5 NUMBERS & PRINT THEM REVERSE
import java.util.*;
class ReverseAr
{
public static void main(String args[])
{
Scanner s=new Scanner(System.in);
int a[]=new int[5];
int i;
System.out.println("Enter 5 numbers");
for(i=0;i<=4;i++)
{
a[i]=Integer.parseInt(s.nextLine());
}
System.out.println("Reverse Values");
for(i=4;i>=0;i--)
{
System.out.println(a[i]);
}
}
}

----------//PROGRAM TO INPUT 5 NUMBERS & CALCULATE THEIR SUM

import java.util.*;
class SumAr
{
public static void main(String args[])
{
Scanner s=new Scanner(System.in);
int a[]=new int[5];
int i;

System.out.println("Enter 5 numbers");
for(i=0;i<=4;i++)
{
a[i]=Integer.parseInt(s.nextLine());
}
int s=0;
for(i=0;i<=4;i++)
{
s=s+a[i];
}
System.out.println("Sum="+s);
}
}

------------------------//PROGRAM TO INPUT 5 NUMBERS & SEARCH AN ELEMENT IN IT(LINEAR SEARCH)

import java.util.*;
class LargestAr
{
public static void main(String args[])
{
Scanner s=new Scanner(System.in);
int a[]=new int[5];
int i;
System.out.println("Enter 5 numbers");
for(i=0;i<=4;i++)
{
a[i]=Integer.parseInt(s.nextLine());
}
System.out.println("Enter Number to Search");
int n=Integer.parseInt(s.nextLine());
for(i=0;i<=4;i++)
{
if(n==a[i])
{
System.out.println("Found at Position="+i);
break;
}
}
if(i==5)
{ System.out.println("Not Found"); }
}
}
---------------------------//PROGRAM TO FIND LARGEST/GREATER NUMBER IN AN ARRAY
import java.util.*;
class LargestAr
{
public static void main(String args[])
{
Scanner s=new Scanner(System.in);
int a[]=new int[5];

int i;
System.out.println("Enter 5 numbers");
for(i=0;i<=4;i++)
{
a[i]=Integer.parseInt(s.nextLine());
}
int m=0;
for(i=0;i<=4;i++)
{
if(m<a[i])
{
m=a[i];
}
}
System.out.println("Largest="+m);
}
}
----------------------------------------2-D Array:
----------//PROGRAM TO INPUT A MATRIX & PRINT ITS TRANSPOSE
import java.util.*;
class Transpose
{
public static void main(String args[])
{
Scanner s=new Scanner(System.in);
System.out.println("Enter 9 numbers");
int r,c;
int a[][]=new int[3][3];
for(r=0;r<=2;r++)
{
for(c=0;c<=2;c++)
{
a[r][c]=Integer.parseInt(s.nextLine());
}
}
System.out.println("Transpose Matrix");
for(r=0;r<=2;r++)
{
for(c=0;c<=2;c++)
{
System.out.print(a[c][r]);
}
System.out.println();
}
}
}
--------------------------------------------------//PROGRAM TO INPUT A MATRIX & calculate sum of left diagonal elements
import java.util.*;
class LeftDiagonal

{
public static void main(String args[])
{
Scanner s=new Scanner(System.in);
System.out.println("Enter 9 numbers");
int r,c;
int a[][]=new int[3][3];
for(r=0;r<=2;r++)
{
for(c=0;c<=2;c++)
{
a[r][c]=Integer.parseInt(s.nextLine());
}
}
int t=0;
for(r=0;r<=2;r++)
{
for(c=0;c<=2;c++)
{
if(r==c)
{ t=t+a[r][c];}
}
}
System.out.println("Sum="+t);
}
}
//Sum of Right Diagonal
if(r+c==2)
{ t=t+a[r][c];}
//PROGRAM TO INPUT 2 3*3 MATRICES & CALCULATE THEIR SUM IN 3RD MATRIX
class Sum-Matrices
{
public static void main(String args[])
{
Scanner s=new Scanner(System.in);
System.out.println("Enter 9 numbers in 1st Matrix");
int r,c;
int a[][]=new int[3][3];
for(r=0;r<=2;r++)
{
for(c=0;c<=2;c++)
{
a[r][c]=Integer.parseInt(s.nextLine());
}
}
int b[][]=new int[3][3];
System.out.println("Enter 9 numbers in 2nd Matrix");
for(r=0;r<=2;r++)
{
for(c=0;c<=2;c++)
{
b[r][c]=Integer.parseInt(s.nextLine());
}
}

int m[][]=new int[3][3];

for(r=0;r<=2;r++)
{
for(c=0;c<=2;c++)
{
m[r][c]=a[r][c]+b[r][c];
}
}
System.out.println("Sum of Matrices");
for(r=0;r<=2;r++)
{
for(c=0;c<=2;c++)
{
System.out.print(m[r][c]);
}
System.out.println();
}
}
}