-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLargestIntInAnArray.java
More file actions
280 lines (226 loc) · 4.99 KB
/
Copy pathLargestIntInAnArray.java
File metadata and controls
280 lines (226 loc) · 4.99 KB
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
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
import java.util.Random;
public class LargestIntInAnArray
{
public static int[] anArray = new int[10];
final static Random rand = new Random();
public static void main(String[] args)
{
MakeRandomArray();
PrintArray(anArray);
System.out.println("Returning the size of the array: " + Size());
System.out.println("Highest Value in array: " + MaxIntInAnArray());
System.out.println("Lowest Value in array: " + LeastIntAnArray());
System.out.println();
System.out.println("Reversing the Array: ");
ReverseArray();
System.out.println();
System.out.print("Multiplying the max and least number: ");
System.out.println(Multiply(MaxIntInAnArray(), LeastIntAnArray()));
//System.out.println();
//System.out.println("Testing out sort: ");
//Sort();
//System.out.println();
//System.out.println("Testing out histogram: ");
histogram();
System.out.println();
System.out.println("Testing out sum of two numbers method: ");
sumOfTwoNumbers(15);
System.out.println();
System.out.println("Testing out if the array has an duplicates: ");
PrintArray(uniqueArray());
System.out.println();
System.out.println("Testing out the kth smallest number method");
PrintArray(anArray);
System.out.println();
kthSmallestNumber(3);
}
/*private static void MostFrequentInt()
{
int[] frequentArray = new int[MaxIntInAnArray()];
int counter = 0;
for (int i = 0; i < anArray.length; i++ )
{
counter = anArray[i];
if (counter )
frequentArray[i] = counter;
}
for(int ii = 0; ii < anArray.length; ii++)
{
System.out.println(frequentArray[ii]);
}
}*/
private static void kthSmallestNumber(int k)
{
int[] newArray = new int[uniqueArray().length]; //will place my sorted new array in here
Sort(); // sorting the anArray so it can be easier to work with
newArray = uniqueArray();
int kthTerm = newArray[k-1];
System.out.println(kthTerm);
}
private static void sumOfTwoNumbers(int sumNumber)
{
boolean checker = false;
for(int i = 0; i < anArray.length; i++)
{
for(int j = i; j < anArray.length - 1; j++)
{
int num1 = anArray[i];
int num2 = anArray[j + 1];
if ((num1 + num2) == sumNumber)
{
checker = true;
System.out.println(num1 + " + " + num2 + " = " + sumNumber);
}
}
}
if (checker == false)
{
System.out.println("there are no numbers in the array that equal " + sumNumber);
}
}
private static int [] uniqueArray()
{
boolean check = false;
int [] newArray = new int[anArray.length];
int index = 0;
newArray[0]=anArray[0];
for(int i = 1; i<anArray.length; i++)
{
for(int j = index; j>= 0; j--)
{
if(anArray[i] != newArray[j])
{
check = true;
}
else
{
check = false;
break;
}
}
if (check == true)
{
newArray[index+1] = anArray[i];
index++;
}
}
int [] newArray2 = new int[index+1];
for(int i = 0; i<=index; i++)
{
newArray2[i]=newArray[i];
}
return newArray2;
}
private static void histogram()
{
int count = 0;
for (int i = 1; i<=MaxIntInAnArray(); i++)
{
for(int j=0; j<anArray.length; j++)
{
if(anArray[j]==i)
{
count++;
}
}
System.out.print(i + ":");
for(int k = 0; k < count; k++)
{
System.out.print("*");
}
System.out.print("\n");
count = 0;
}
}
private static void Sort()
// Bubble Sort
{
int temp = 0;
for (int i = 0; i < anArray.length; i++)
{
for (int j = 1; j < anArray.length - i; j++)
{
if (anArray[j - 1] >anArray[j])
{
temp = anArray[j - 1];
anArray[j - 1] =anArray[j];
anArray[j] = temp;
}
}
}
}
private static void ReverseArray()
{
int[] newArray = new int[anArray.length];
for (int i =0; i < anArray.length; i++)
{
{
newArray[i]= anArray[anArray.length-1-i];
}
}
for(int i = 0; i < anArray.length; i++)
{
System.out.println(newArray[i]);
}
}
private static int Multiply(int a, int b)
// Multiplying numbers without using the * sign
// In this particular example we will multiply the highest and lowest value
{
if (a == 0 || b == 0)
return 0;
if (a == 1)
return b;
else
return Multiply(a, b-1) + a;
}
private static int MaxIntInAnArray()
{
int maxInt = 0;
for(int i = 1; i < anArray.length; i++)
{
if (anArray[i] > maxInt)
{
maxInt = anArray[i];
}
}
return maxInt;
}
private static int LeastIntAnArray()
{
int LeastInt = 0;
LeastInt = anArray[0];
for (int i = 0; i < anArray.length; i++)
{
if(anArray[i] < LeastInt)
{
LeastInt = anArray[i];
}
}
return LeastInt;
}
private static int Size()
{
int size = 0;
for (int i = 0; i < anArray.length; i++)
{
size++;
}
return size;
}
private static void PrintArray(int[] array)
{
for(int i = 0; i < array.length; i++)
{
System.out.println(array[i]);
}
}
private static void MakeRandomArray ()
{
for (int ii = 0; ii < anArray.length; ii++)
{
int number = rand.nextInt(10) + 1;
anArray[ii] = number;
}
}
}