Scribd
Upload
9 views10 pages

Java Array Operations and Examples

The document contains Java code examples demonstrating various array operations, including reading elements, displaying them using different loops, calculating sums, finding maximum and minimum values, and updating elements. It also includes logic for updating occurrences of elements in an array, such as replacing all occurrences, the first occurrence, the second occurrence, and the last occurrence. Additionally, it provides a structured approach to handle user input and output for these operations.

Uploaded by

Rehan Hussain
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
9 views10 pages

Java Array Operations and Examples

The document contains Java code examples demonstrating various array operations, including reading elements, displaying them using different loops, calculating sums, finding maximum and minimum values, and updating elements. It also includes logic for updating occurrences of elements in an array, such as replacing all occurrences, the first occurrence, the second occurrence, and the last occurrence. Additionally, it provides a structured approach to handle user input and output for these operations.

Uploaded by

Rehan Hussain
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

DURGASOFT

import [Link];

class Test
{
public static void main(String[] args)
{
Scanner obj = new Scanner([Link]);

[Link]("Enter array size:");


int size = [Link]();

int i,a[] = new int[size];

[Link]("Enter "+size+" elements...");


for(i=0;i<[Link];i++){
a[i] = [Link]();
}

[Link]("Array elements by using while loop..");


int index=0;
while(index<[Link])
{
[Link]("index="+index+" a["+index+"]="+a[index]);
index++;
}

[Link]("Array elements by using for loop..");


for(i=0;i<[Link];i++)
{
[Link]("index="+i+" a["+i+"]="+a[i]);
}

[Link]("Array elements by using for each loop..");


for(int item:a)
{
[Link]("item="+item);
}
}
}

output:
-------
C:\prakashclasses>javac [Link]
DURGASOFT, # 202, 2nd Floor, HUDA Maitrivanam, Ameerpet, Hyderabad - 500038,
91  88 85 25 26 27, 72 07 21 24 27/28 | [Link]
Maii: durgasoftonline@[Link]
DURGASOFT
C:\prakashclasses>java Test
Enter array size:
5
Enter 5 elements...
999
123
555
222
999
Array elements by using while loop..
index=0 a[0]=999
index=1 a[1]=123
index=2 a[2]=555
index=3 a[3]=222
index=4 a[4]=999
Array elements by using for loop..
index=0 a[0]=999
index=1 a[1]=123
index=2 a[2]=555
index=3 a[3]=222
index=4 a[4]=999
Array elements by using for each loop..
item=999
item=123
item=555
item=222
item=999

sum of elements in array


------------------------
==> using for loop
==> using for each loop

Ex:
import [Link];

class Test
{
public static void main(String[] args)
{
Scanner obj = new Scanner([Link]);

DURGASOFT, # 202, 2nd Floor, HUDA Maitrivanam, Ameerpet, Hyderabad - 500038,


92  88 85 25 26 27, 72 07 21 24 27/28 | [Link]
Maii: durgasoftonline@[Link]
DURGASOFT
[Link]("Enter array size:");
int size = [Link]();

int sum=0,i,a[] = new int[size];

[Link]("Enter "+size+" elements...");


for(i=0;i<[Link];i++){
a[i] = [Link]();
}

sum=0;
for(i=0;i<[Link];i++)
{
sum=sum+a[i];
}
[Link](sum);

}
}

output:
-------
C:\prakashclasses>javac [Link]

C:\prakashclasses>java Test
Enter array size:
5
Enter 5 elements...
12
10
3
11
13
49

Program to read and write array elements.


Program to calcualte sum of elements present in an array.
Program to calcualte sum of even elements present in an array.
Program to calcualte sum of odd elements present in an array.
Program to calcualte sum of +ve elements present in an array.
Program to calcualte sum of -ve elements present in an array.

DURGASOFT, # 202, 2nd Floor, HUDA Maitrivanam, Ameerpet, Hyderabad - 500038,


93  88 85 25 26 27, 72 07 21 24 27/28 | [Link]
Maii: durgasoftonline@[Link]
DURGASOFT
Program to calcualte sum of elements which are divisible by 2 and 3 present in an
array.
Program to calcualte sum of prime elements present in an array.
Program to calcualte sum of all elements factorials present in an array.

Logic:
------
sum = 0;
for(i=0;i<[Link];i++)
{
if(-----){
sum=sum+a[i];
}
}
s.o.p(sum);

iseven(a[i]),isodd,isprime,ispve,isnve,sum,etc

Program to find max and min element present in an array


-------------------------------------------------------
import [Link];

class Test
{
public static void main(String[] args)
{
Scanner obj = new Scanner([Link]);

[Link]("Enter array size:");


int size = [Link]();

int max,min,i,a[] = new int[size];

[Link]("Enter "+size+" elements...");


for(i=0;i<[Link];i++){
a[i] = [Link]();
}

max=a[0];
for(i=1;i<[Link];i++)
{
if(max<a[i])
DURGASOFT, # 202, 2nd Floor, HUDA Maitrivanam, Ameerpet, Hyderabad - 500038,
94  88 85 25 26 27, 72 07 21 24 27/28 | [Link]
Maii: durgasoftonline@[Link]
DURGASOFT
{
max=a[i];
}
}
[Link]("max="+max);

min=a[0];
for(i=1;i<[Link];i++)
{
if(min>a[i])
{
min=a[i];
}
}
[Link]("min="+min);
}
}

output:
-------
C:\prakashclasses>javac [Link]

C:\prakashclasses>java Test
Enter array size:
5
Enter 5 elements...
3
5
2
4
1
max=5
min=1

Program to replace old element with new element


-----------------------------------------------
version1: update all occurrences
--------------------------------
Ex:
import [Link];

class Test
DURGASOFT, # 202, 2nd Floor, HUDA Maitrivanam, Ameerpet, Hyderabad - 500038,
95  88 85 25 26 27, 72 07 21 24 27/28 | [Link]
Maii: durgasoftonline@[Link]
DURGASOFT
{
public static void main(String[] args)
{
Scanner obj = new Scanner([Link]);

[Link]("Enter array size:");


int size = [Link]();

int i,a[] = new int[size];

[Link]("Enter "+size+" elements...");


for(i=0;i<[Link];i++){
a[i] = [Link]();
}

[Link]("Array Elements Before update...");


for(i=0;i<[Link];i++)
[Link](a[i]+" ");
[Link]();

//logic
int olde,newe;
[Link]("Enter old element");
olde=[Link]();
[Link]("Enter new element");
newe=[Link]();
for(i=0;i<[Link];i++)
{
if(olde==a[i]){
a[i]=newe;
}
}

[Link]("Array Elements After update...");


for(i=0;i<[Link];i++)
[Link](a[i]+" ");

}
}

output:
-------
C:\prakashclasses>javac [Link]
DURGASOFT, # 202, 2nd Floor, HUDA Maitrivanam, Ameerpet, Hyderabad - 500038,
96  88 85 25 26 27, 72 07 21 24 27/28 | [Link]
Maii: durgasoftonline@[Link]
DURGASOFT
C:\prakashclasses>java Test
Enter array size:
5
Enter 5 elements...
12123
Array Elements Before update...
12123
Enter old element
2
Enter new element
9
Array Elements After update...
19193

version2: update only first occurrence


--------------------------------------
import [Link];

class Test
{
public static void main(String[] args)
{
Scanner obj = new Scanner([Link]);

[Link]("Enter array size:");


int size = [Link]();

int i,a[] = new int[size];

[Link]("Enter "+size+" elements...");


for(i=0;i<[Link];i++){
a[i] = [Link]();
}

[Link]("Array Elements Before update...");


for(i=0;i<[Link];i++)
[Link](a[i]+" ");
[Link]();

//logic
int olde,newe;
[Link]("Enter old element");
DURGASOFT, # 202, 2nd Floor, HUDA Maitrivanam, Ameerpet, Hyderabad - 500038,
97  88 85 25 26 27, 72 07 21 24 27/28 | [Link]
Maii: durgasoftonline@[Link]
DURGASOFT
olde=[Link]();
[Link]("Enter new element");
newe=[Link]();
for(i=0;i<[Link];i++)
{
if(olde==a[i]){
a[i]=newe;
break;
}
}

[Link]("Array Elements After update...");


for(i=0;i<[Link];i++)
[Link](a[i]+" ");

}
}

output:
-------
C:\prakashclasses>javac [Link]

C:\prakashclasses>java Test
Enter array size:
5
Enter 5 elements...
12312
Array Elements Before update...
12312
Enter old element
2
Enter new element
8
Array Elements After update...
18312

version3: update only second occurrence


---------------------------------------
import [Link];

class Test
{
public static void main(String[] args)
DURGASOFT, # 202, 2nd Floor, HUDA Maitrivanam, Ameerpet, Hyderabad - 500038,
98  88 85 25 26 27, 72 07 21 24 27/28 | [Link]
Maii: durgasoftonline@[Link]
DURGASOFT
{
Scanner obj = new Scanner([Link]);

[Link]("Enter array size:");


int size = [Link]();

int i,a[] = new int[size];

[Link]("Enter "+size+" elements...");


for(i=0;i<[Link];i++){
a[i] = [Link]();
}

[Link]("Array Elements Before update...");


for(i=0;i<[Link];i++)
[Link](a[i]+" ");
[Link]();

//logic
int olde,newe;
[Link]("Enter old element");
olde=[Link]();
[Link]("Enter new element");
newe=[Link]();
int c=0;
for(i=0;i<[Link];i++)
{
if(olde==a[i]){
c++;
if(c==2)
{
a[i]=newe;
break;
}
}
}

[Link]("Array Elements After update...");


for(i=0;i<[Link];i++)
[Link](a[i]+" ");

}
}
DURGASOFT, # 202, 2nd Floor, HUDA Maitrivanam, Ameerpet, Hyderabad - 500038,
99  88 85 25 26 27, 72 07 21 24 27/28 | [Link]
Maii: durgasoftonline@[Link]
DURGASOFT
output:
-------
C:\prakashclasses>javac [Link]

C:\prakashclasses>java Test
Enter array size:
7
Enter 7 elements...
1231212
Array Elements Before update...
1231212
Enter old element
2
Enter new element
44
Array Elements After update...
1 2 3 1 44 1 2

version4: last occurrence


-------------------------
import [Link];

class Test
{
public static void main(String[] args)
{
Scanner obj = new Scanner([Link]);

[Link]("Enter array size:");


int size = [Link]();

int i,a[] = new int[size];

[Link]("Enter "+size+" elements...");


for(i=0;i<[Link];i++){
a[i] = [Link]();
}

[Link]("Array Elements Before update...");


for(i=0;i<[Link];i++)
[Link](a[i]+" ");
[Link]();
DURGASOFT, # 202, 2nd Floor, HUDA Maitrivanam, Ameerpet, Hyderabad - 500038,
100  88 85 25 26 27, 72 07 21 24 27/28 | [Link]
Maii: durgasoftonline@[Link]

You might also like