algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-27 06:23:08 +08:00
Code Issues Packages Projects Releases Wiki Activity

Format code with prettier (#3375)

Browse Source
This commit is contained in:
acbin
2022-10-03 17:23:00 +08:00
committed by GitHub
parent 32b9b11ed5
commit e96f567bfc
464 changed files with 11483 additions and 6189 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
src/main/java/com/thealgorithms/maths/Median.java
View File

@ -8,11 +8,11 @@ import java.util.Arrays;
public class Median {
public static void main(String[] args) {
assert median(new int[]{0}) == 0;
assert median(new int[]{1, 2}) == 1.5;
assert median(new int[]{4, 1, 3, 2}) == 2.5;
assert median(new int[]{1, 3, 3, 6, 7, 8, 9}) == 6;
assert median(new int[]{1, 2, 3, 4, 5, 6, 8, 9}) == 4.5;
assert median(new int[] { 0 }) == 0;
assert median(new int[] { 1, 2 }) == 1.5;
assert median(new int[] { 4, 1, 3, 2 }) == 2.5;
assert median(new int[] { 1, 3, 3, 6, 7, 8, 9 }) == 6;
assert median(new int[] { 1, 2, 3, 4, 5, 6, 8, 9 }) == 4.5;
}
/**
@ -25,7 +25,7 @@ public class Median {
Arrays.sort(values);
int length = values.length;
return length % 2 == 0
? (values[length / 2] + values[length / 2 - 1]) / 2.0
: values[length / 2];
? (values[length / 2] + values[length / 2 - 1]) / 2.0
: values[length / 2];
}
}