-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBasics.java
More file actions
128 lines (111 loc) · 3.95 KB
/
Basics.java
File metadata and controls
128 lines (111 loc) · 3.95 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
import java.util.ArrayList;
import java.util.Arrays;
public class Basics {
public static void main(String[] args) {
Counter();
oddCounter();
sumCounter();
printArray(new int[]{1, 2, 3, 4, 5});
findMax(new int[]{5, 10, 15, 20, 25});
findMin(new int[]{10, 20, 30, 40, 50});
arrayAverage(new int[]{5, 15, 25, 45, 95});
oddArray();
yGreaterThan(new int[]{3, 5, 7, 9, 11}, 5);
squareArray(new Double[]{2.0, 3.0, 4.0, 5.0, 6.0});
noNegatives(new int[]{-5, -3, -1, 0, 1, 3, 5});
minMaxAverage(new int[]{5, 10, 15, 20, 25, 35});
shiftArrayDown(new int[]{1, 2, 3, 4, 5});
}
public static void Counter(){
for (int x = 0; x < 255; x++){
System.out.println(x);}
}
public static void oddCounter(){
for (int x = 0; x < 255; x++){
if (x % 2 == 1)
System.out.println(x);}
}
public static void sumCounter(){
int x;
int sum = 0;
for( x = 0; x < 255; x++) {
sum += x;
}
System.out.printf("Number: " + x, " Sum: " + sum);
}
public static void printArray(int[] array){
for(int x = 0; x < array.length; x++){
System.out.println("Element " + x + ", value is " +array[x]);
}
}
public static int findMax(int[] array){
int max = 0;
for (int x = 0; x < array.length; x++){
if (array[x] > max)
max= array[x];
}
return max;
}
public static int findMin(int[] array){
int min = array[0];
for (int x = 0; x < array.length; x++){
if (array[x] < min)
min = array[x];
}
return min;
}
public static double arrayAverage(int[] array){
int sum = 0;
for (int i : array) {
sum += i;
}
return (double) sum / (double)array.length;
}
public static void oddArray(){
ArrayList<Integer> odd = new ArrayList<Integer>();
for (int x = 0; x < 255; x++){
if (x % 2 == 1)
odd.add(x);
}
}
public static int yGreaterThan(int[] array, int y){
int count = 0;
for(int x = 0; x < array.length; x++){
if(x > y)
count++;
}
return count;
}
public static void squareArray(Double[] squared){
for(int x = 0; x < squared.length; x++){
squared[x]= Math.pow(squared[x], 2);
System.out.println(Arrays.toString(squared));
}
}
public static int[] noNegatives(int[] numbers) {
for(int x = 0; x < numbers.length; x++){
if(numbers[x] < 0)
numbers[x] = 0;
}
System.out.println(Arrays.toString(numbers));
return numbers;
}
public static void minMaxAverage(int[] data){
int min = findMin(data);
int max = findMax(data);
double avg = arrayAverage(data);
data[0] = min;
data[1] = max;
data[2] = (int) avg;
System.out.println(Arrays.toString(data));
}
public static int[] shiftArrayDown(int[] array1){
int[] array2 = new int[array1.length];
for (int x = 0; x <array1.length; x++){
array2[x - 1] = array1[x];
array2[array2.length] = 0;
}
System.out.println(Arrays.toString(array2));
return array2;
}
}