-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathArrayManually.java
More file actions
92 lines (73 loc) · 2.17 KB
/
ArrayManually.java
File metadata and controls
92 lines (73 loc) · 2.17 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
class Array {
int []arr;
//getting the size via constructor
Array(int size) {
arr = new int[size];
}
//initializing the array
void setArr(int index, int value) {
arr[index] = value;
}
//getting the sum of the array
int getSum() {
int sum = 0;
for(int i=0; i<arr.length; i++) {
sum = sum + arr[i];
}
return sum;
}
//finding the maximum value for array
int findMax() {
int max = -9999999; // int max = -9999999 (as small as possible)
for (int i=0; i<arr.length; i++)
{
if (arr[i] > max)
max = arr[i];
}
return max;
}
//
boolean sumChecker() {
int sum = getSum();
if (sum % 2 == 0)
return true;
else
return false;
//return sum % 2 == 0; can be written as well.
}
//checking if it's divisible by the parameter
int divisibility(int n) {
int divisibleTime = 0;
for (int i=0; i<arr.length; i++) {
if(arr[i] > 0) //size is 10, but 7 of 'em have been initialized; so by default unused value will be 0 [0%n=0]
{
if (arr[i] % n == 0) {
divisibleTime++;
}
}
}
return divisibleTime;
}
}
public class ArrayManually {
public static void main(String[] args)
{
Array arr = new Array(10); //passing the size to constructor
//assigning the values to the array; up to size
arr.setArr(0,1);
arr.setArr(1,2);
arr.setArr(2,3);
arr.setArr(3,4);
arr.setArr(4,5);
arr.setArr(5,6);
arr.setArr(6,7);
//maximum value of the array
System.out.println("maximum value : " + arr.findMax());
//getting sum of the array
System.out.println("sum of the array : " + arr.getSum());
//checking if the input is odd or even
System.out.println("sum of the array is even : " + arr.sumChecker());
//checking times of division by the parameter
System.out.println("divides " + arr.divisibility(2) + " times");
}
}