Scribd
Upload
6 views10 pages

Java Array Manipulation Programs

The document provides Java programs for various array operations including updating elements, sorting in ascending and descending order, and using predefined sorting methods. It includes examples of user input for array size and elements, as well as handling exceptions for invalid indices. The document also demonstrates customized sorting techniques and outputs the results of each operation.

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
6 views10 pages

Java Array Manipulation Programs

The document provides Java programs for various array operations including updating elements, sorting in ascending and descending order, and using predefined sorting methods. It includes examples of user input for array size and elements, as well as handling exceptions for invalid indices. The document also demonstrates customized sorting techniques and outputs the results of each operation.

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

//logic
int olde,newe;
[Link]("Enter old element");
olde=[Link]();
[Link]("Enter new element");
newe=[Link]();
int c=0;
for(i=[Link]-1;i>=0;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:
6
Enter 6 elements...
123125
Array Elements Before update...
123125
Enter old element
2
Enter new element
7
Array Elements After update...
123175

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


101  88 85 25 26 27, 72 07 21 24 27/28 | [Link]
Maii: durgasoftonline@[Link]
DURGASOFT
Program to replace given location with new element
---------------------------------------------------
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 index,newe;
[Link]("Enter index value:");
index=[Link]();
if(index>=0 && index<[Link]){
[Link]("Enter new element");
newe=[Link]();
a[index]=newe;
}
else{
[Link]("ArrayIndexOutOfBoundsException");
}

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


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

}
DURGASOFT, # 202, 2nd Floor, HUDA Maitrivanam, Ameerpet, Hyderabad - 500038,
102  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:
6
Enter 6 elements...
10 20 30 40 50 60
Array Elements Before update...
10 20 30 40 50 60
Enter index value:
2
Enter new element
90
Array Elements After update...
10 20 90 40 50 60
C:\prakashclasses>java Test
Enter array size:
6
Enter 6 elements...
10 20 30 40 50 60
Array Elements Before update...
10 20 30 40 50 60
Enter index value:
9
ArrayIndexOutOfBoundsException
Array Elements After update...
10 20 30 40 50 60

Program to sort the elements present in the array


-------------------------------------------------
version1: sort the elements in asc order
----------------------------------------
import [Link].*;
class Test
{
public static void main(String[] args)
{
Scanner obj = new Scanner([Link]);
DURGASOFT, # 202, 2nd Floor, HUDA Maitrivanam, Ameerpet, Hyderabad - 500038,
103  88 85 25 26 27, 72 07 21 24 27/28 | [Link]
Maii: durgasoftonline@[Link]
DURGASOFT
[Link]("Enter array size:");
int i,j,t,n = [Link]();

int a[] = new int[n];


[Link]("Enter "+n+" elements.");
for(i=0;i<n;i++)
a[i] = [Link]();

[Link]("Array Elements Before Sorting:");


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

//version1==> sort the data in asc order


for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
if(a[i]>a[j]){
t = a[i];
a[i]=a[j];
a[j]=t;
}
}
}

[Link]();
[Link]("Array Elements After Sorting:");
for(i=0;i<n;i++)
[Link](a[i]+" ");

}
}

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

C:\prakashclasses>java Test
Enter array size:
5
Enter 5 elements.
13254
DURGASOFT, # 202, 2nd Floor, HUDA Maitrivanam, Ameerpet, Hyderabad - 500038,
104  88 85 25 26 27, 72 07 21 24 27/28 | [Link]
Maii: durgasoftonline@[Link]
DURGASOFT
Array Elements Before Sorting:
13254
Array Elements After Sorting:
12345

String s = "acbed";
[Link]() ----> {'a','c','b','e','d'} ---> {'a''b','c','e','d'}

version2: sort the elements in desc order


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

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


int i,j,t,n = [Link]();

int a[] = new int[n];


[Link]("Enter "+n+" elements.");
for(i=0;i<n;i++)
a[i] = [Link]();

[Link]("Array Elements Before Sorting:");


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

//version2==> sort the data in desc order


for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
if(a[i]<a[j]){
t = a[i];
a[i]=a[j];
a[j]=t;
}
}
}

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

}
}

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

C:\prakashclasses>java Test
Enter array size:
5
Enter 5 elements.
14253
Array Elements Before Sorting:
14253
Array Elements After Sorting:
54321

version3: sorting an array by using predefined classes


------------------------------------------------------
[Link](a)

Ex:
import [Link].*;
class Test
{
public static void main(String[] args)
{
Scanner obj = new Scanner([Link]);

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


int i,n = [Link]();

int a[] = new int[n];


[Link]("Enter "+n+" elements.");
for(i=0;i<n;i++)
a[i] = [Link]();

[Link]("Array Elements Before Sorting:");


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

//version3==> by using predefined methods ASC


[Link](a);

[Link]();
[Link]("Array Elements After Sorting:");
for(i=0;i<n;i++)
[Link](a[i]+" ");

}
}

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

C:\prakashclasses>java Test
Enter array size:
6
Enter 6 elements.
142563
Array Elements Before Sorting:
142563
Array Elements After Sorting:
123456

version4: by using predefined only but desc


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

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


int i,n = [Link]();

int a[] = new int[n];


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

//version4==> by using predefined methods ASC


[Link](a);

[Link]();
[Link]("Array Elements After Sorting:");
for(i=n-1;i>=0;i--)
[Link](a[i]+" ");

}
}

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

C:\prakashclasses>java Test
Enter array size:
6
Enter 6 elements.
142563
Array Elements Before Sorting:
142563
Array Elements After Sorting:
654321

version5: customized sorting


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

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


int i,n = [Link]();

int a[] = new int[n];


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

[Link]("Array Elements Before Sorting:");


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

//version5==> by using customized sorting


//start and ending location
[Link](a,0,n/2);

[Link]();
[Link]("Array Elements After Sorting:");
for(i=0;i<n;i++)
[Link](a[i]+" ");

}
}

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

C:\prakashclasses>java Test
Enter array size:
6
Enter 6 elements.
162543
Array Elements Before Sorting:
162543
Array Elements After Sorting:
126543

Ex:
import [Link].*;
class Test
{
public static void main(String[] args)
{
Scanner obj = new Scanner([Link]);

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


DURGASOFT, # 202, 2nd Floor, HUDA Maitrivanam, Ameerpet, Hyderabad - 500038,
109  88 85 25 26 27, 72 07 21 24 27/28 | [Link]
Maii: durgasoftonline@[Link]
DURGASOFT
int i,n = [Link]();

int a[] = new int[n];


[Link]("Enter "+n+" elements.");
for(i=0;i<n;i++)
a[i] = [Link]();

[Link]("Array Elements Before Sorting:");


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

//version5==> by using customized sorting


//start and ending location
[Link](a,n/2,n);

[Link]();
[Link]("Array Elements After Sorting:");
for(i=0;i<n;i++)
[Link](a[i]+" ");

}
}

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

C:\prakashclasses>java Test
Enter array size:
6
Enter 6 elements.
162543
Array Elements Before Sorting:
162543
Array Elements After Sorting:
162345

sort asc ----> 0 to n/2, n to n/2

for(i=0;i<n/2;i++){}
for(i=n/2;i<n;i++){}

Ex:
DURGASOFT, # 202, 2nd Floor, HUDA Maitrivanam, Ameerpet, Hyderabad - 500038,
110  88 85 25 26 27, 72 07 21 24 27/28 | [Link]
Maii: durgasoftonline@[Link]

You might also like