kaltinsoy/java
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Assignment2

Browse Source
This commit is contained in:
k0rrluna
2024-11-07 02:46:19 +03:00
parent cb2460ee46
commit 95ebce05ed
4 changed files with 50 additions and 28 deletions
Download Patch File Download Diff File Expand all files Collapse all files

54
assignments/assignment2/numbers.java
View File

@ -2,37 +2,37 @@ import java.util.*;
public class numbers {
public static void main(String args[]) {
ArrayList<Integer> ints = new ArrayList<Integer>();
Scanner scan = new Scanner(System.in);
System.out.println("Enter positive integer! (Enter -1 to stop!)");
ArrayList<Integer> ints = new ArrayList<Integer>();
Scanner scan = new Scanner(System.in);
System.out.println("Enter positive integer! (Enter -1 to stop!)");
int counter = 0;
double sum = 0;
double median = 0;
int counter = 0;
double sum = 0;
double median = 0;
while (true) {
int input1 = scan.nextInt();
if (input1 == -1) {
break;
} else if (input1 > 0) {
ints.add(input1);
sum += input1;
counter++;
} else {
System.out.println("Not Positive!");
}
}
//Collections.sort(ints);
for (int i = 0; i < counter - 1; i++) {
int minValue = i;
for (int j = i + 1; j < counter; j++) {
if (ints.get(j) < ints.get(minValue)) {
minValue = j;
while (true) {
int input1 = scan.nextInt();
if (input1 == -1) {
break;
} else if (input1 > 0) {
ints.add(input1);
sum += input1;
counter++;
} else {
System.out.println("Not Positive!");
}
}
int t = ints.get(i);
ints.set(i, ints.get(minValue));
ints.set(minValue, t);
//Collections.sort(ints);
for (int i = 0; i < counter - 1; i++) {
int minValue = i;
for (int j = i + 1; j < counter; j++) {
if (ints.get(j) < ints.get(minValue)) {
minValue = j;
}
}
int t = ints.get(i);
ints.set(i, ints.get(minValue));
ints.set(minValue, t);
}