-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathMenuDrivenOnArrays.java
121 lines (100 loc) · 2.52 KB
/
MenuDrivenOnArrays.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
/*import java.util.*;
class FindEl
{
public String findEl(int arr[],int val)
{
int c=0;
for(int i=0;i<arr.length;i++)
{
if(arr[i]==val)
{
c+=1;
}
}
if(c!=0)
return "Element Present";
else
return "not foung";
}
}
class FindLargest
{
public int findLargest(int arr[])
{
int max=arr[0];
for(int i=1;i<arr.length;i++)
{
if(arr[i]>max)
max=arr[i];
}
return max;
}
}
//Sorting class
class SortArray
{
public String sort(int arr[])
{
System.out.println("Original Array: "+arr);
for(int i: arr)
{
System.out.print(i+" ");
}
Arrays.sort(arr);
System.out.println();
System.out.println("Sorted Array: ");
String str="";
for(int i:arr)
{
str=str+i+" ";
}
return str;
}
}
class RemoveDupliate
{
static int removeDuplicates(int arr[])
{
int n=arr.length;
if (n == 0 || n == 1)
return n;
int[] temp = new int[n];
int j = 0;
for (int i = 0; i < n - 1; i++)
if (arr[i] != arr[i + 1])
temp[j++] = arr[i];
temp[j++] = arr[n - 1];
for (int i = 0; i < j; i++)
arr[i] = temp[i];
return j;
}
public static void main(String[] args)
{
int arr[] = { 1, 2, 2, 3, 4, 4, 4, 5, 5 };
int nt = arr.length;
nt = removeDuplicates(arr);
// Print updated array
for (int i = 0; i < nt; i++)
System.out.print(arr[i] + " ");
}
}
public class MenuDrivenOnArrays
{
public static void main(String args[])
{
FindLargest a=new FindLargest();
int arr[]={65,21,45,87,65,32,98,45,1,5,8,6,4,7,2};
System.out.println(a.findLargest(arr));
FindEl n=new FindEl();
System.out.println(n.findEl(arr, 5));
SortArray s=new SortArray();
System.out.println(s.sort(arr));
RemoveDupliate rd=new RemoveDupliate();
rd.removeDuplicates(arr);
int a = arr.length;
a = removeDuplicates(arr);
// Print updated array
for (int i = 0; i < a; i++)
System.out.print(arr[i] + " ");
}
}*/