Scribd
Upload
7 views10 pages

Java With DSA

The document contains Java programs demonstrating various array manipulations, including sorting, finding minimum and maximum elements, and searching algorithms like linear and binary search. It provides examples of how to implement these functionalities, along with sample outputs. Additionally, it includes instructions for printing elements in a wave form and finding specific order statistics like the second largest and second smallest elements.

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

Java With DSA

The document contains Java programs demonstrating various array manipulations, including sorting, finding minimum and maximum elements, and searching algorithms like linear and binary search. It provides examples of how to implement these functionalities, along with sample outputs. Additionally, it includes instructions for printing elements in a wave form and finding specific order statistics like the second largest and second smallest elements.

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 any string:");


String s = [Link]();

char t,a[] = [Link]();


//[Link](ch);
for(int i=0;i<[Link];i++)
{
for(int j=i+1;j<[Link];j++)
{
if(a[i]>a[j]){
t = a[i];
a[i]=a[j];
a[j]=t;
}
}
}

[Link](new String(a));
}
}

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

C:\prakashclasses>java Test
Enter any string:
azbc1m3d2
123abcdmz

After sorting the elements ---> min.........max

a[0],a[1],a[2],........a[n-2],a[n-1]

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


111  88 85 25 26 27, 72 07 21 24 27/28 | [Link]
Maii: durgasoftonline@[Link]
DURGASOFT
1st min -----> a[1-1] ----> a[0]
2nd min -----> a[2-1] ----> a[1]
3rd min -----> a[3-1] ----> a[2]
.
.
nth min -----> a[n-1]

Ex:
5
41352
12345

1st min ---> a[1-1] = a[0] = 1


2nd min ---> a[2-1] = a[1] = 2
3rd min ---> a[3-1] = a[2] = 3
4th min ---> a[4-1] = a[3] = 4
5th min ---> a[5-1] = a[4] = 5

a[0],a[1],a[2],........a[n-2],a[n-1]

1st max -----> a[n-1]


2nd max -----> a[n-2]
3rd max -----> a[n-3]
4th max -----> a[n-4]
5th max -----> a[n-5]
.
.
nth max -----> a[n-n] = a[0]

Ex:
5
41352
12345

1st max ----> a[5-1] = a[4] = 5


2nd max ----> a[5-2] = a[3] = 4
3rd max ----> a[5-3] = a[2] = 3
4th max ----> a[5-4] = a[1] = 2
5th max ----> a[5-5] = a[0] = 1

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


112  88 85 25 26 27, 72 07 21 24 27/28 | [Link]
Maii: durgasoftonline@[Link]
DURGASOFT
Program to find max and min element present in an array.
Program to find 2nd max and 2nd min element present in an array.
Program to find 3rd max and 3rd min element present in an array.

kprakashbabutechnicaltrainer@[Link]

Program to print 1st smallest, 1st largest, 2nd smallest, 2nd largest and so on
-----------------------------------------------------------------------------------
n=5
14253

12345

output: 1 5 2 3 4 4

n=6
146253

123456

output: 1 6 2 5 3 4

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](a);

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

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

C:\prakashclasses>java Test
Enter array size:
5
Enter 5 elements...
15324
152433
C:\prakashclasses>java Test
Enter array size:
6
Enter 6 elements...
153642
162534

Print all elements in an array in wave form


~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Ex:
n=6
152463

123456

output:

132546

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

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


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

int a[] = new int[n];


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

[Link](a);

[Link](a[0]+" ");
for(i=1;i<n-1;i=i+2)
{
t=a[i];
a[i]=a[i+1];
a[i+1]=t;
[Link](a[i]+" "+a[i+1]+" ");
}
if(n%2==0)
[Link](a[i]);
}
}

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

C:\prakashclasses>java Test
Enter array size:
6
Enter 6 elements...
153462
132546
C:\prakashclasses>java Test
Enter array size:
5
DURGASOFT, # 202, 2nd Floor, HUDA Maitrivanam, Ameerpet, Hyderabad - 500038,
115  88 85 25 26 27, 72 07 21 24 27/28 | [Link]
Maii: durgasoftonline@[Link]
DURGASOFT
Enter 5 elements...
15234
13254

searching:
----------

linear search and binary search

Implement a program to search for an element in an array


--------------------------------------------------------
Ex:
import [Link].*;

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

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


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

int a[] = new int[n];


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

[Link]("Enter the element to search:");


int key = [Link]();

int index = -1;

for(i=0;i<n;i++)
{
if(key==a[i]){
index = i;
break;
}
}

[Link](index);
DURGASOFT, # 202, 2nd Floor, HUDA Maitrivanam, Ameerpet, Hyderabad - 500038,
116  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...
152347
Enter the element to search:
5
1

C:\prakashclasses>java Test
Enter array size:
6
Enter 6 elements...
152347
Enter the element to search:
9
-1

sir array elements are 1 2 3 5 5 how to find second largest

12355
01234

2nd max -----> a[5-2] ---> a[3] = 5

binary search:
~~~~~~~~~~~~~~
Here first we have to sort the elements in asc order, then compare key element with
middle elements if result found then return the result else we can compare either in
left part or right part.

Ex:
import [Link].*;
DURGASOFT, # 202, 2nd Floor, HUDA Maitrivanam, Ameerpet, Hyderabad - 500038,
117  88 85 25 26 27, 72 07 21 24 27/28 | [Link]
Maii: durgasoftonline@[Link]
DURGASOFT
class Demo
{
static int binarysearch(int a[],int key){
int l=0,h=[Link]-1,mid;

while(l<=h){
mid=(l+h)/2;
if(a[mid]==key)
return mid;
else if(a[mid]<key)
l=mid+1;
else
h=mid-1;
}

return -1;
}
}

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

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


int n = [Link]();

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

[Link]("Enter "+n+" values:");


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

[Link]("Enter the value to search:");


int key = [Link]();

[Link](a);

[Link]([Link](a,key));
}
}
DURGASOFT, # 202, 2nd Floor, HUDA Maitrivanam, Ameerpet, Hyderabad - 500038,
118  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 values:
10 20 30 40 50 60
Enter the value to search:
10
0

C:\prakashclasses>java Test
Enter array size:
6
Enter 6 values:
10 20 30 40 50 60
Enter the value to search:
60
5

C:\prakashclasses>java Test
Enter array size:
6
Enter 6 values:
10 20 30 40 50 60
Enter the value to search:
90
-1

Ex:
import [Link].*;

class Demo
{
static int binarysearch(int a[],int l,int h,int key){
if(l<=h){
int mid=(l+h)/2;
if(a[mid]==key)
return mid;
else if(a[mid]<key)
DURGASOFT, # 202, 2nd Floor, HUDA Maitrivanam, Ameerpet, Hyderabad - 500038,
119  88 85 25 26 27, 72 07 21 24 27/28 | [Link]
Maii: durgasoftonline@[Link]
DURGASOFT
return binarysearch(a,mid+1,h,key);
else
return binarysearch(a,l,mid-1,key);
}
return -1;
}
}

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

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


int n = [Link]();

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

[Link]("Enter "+n+" values:");


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

[Link]("Enter the value to search:");


int key = [Link]();

[Link](a);

[Link]([Link](a,0,[Link]-1,key));
}
}

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

C:\prakashclasses>java Test
Enter array size:
5
Enter 5 values:
12345
Enter the value to search:
2
DURGASOFT, # 202, 2nd Floor, HUDA Maitrivanam, Ameerpet, Hyderabad - 500038,
120  88 85 25 26 27, 72 07 21 24 27/28 | [Link]
Maii: durgasoftonline@[Link]

You might also like