September 2017 Update
This commit is contained in:
parent
bba7bfd280
commit
ba8067c3b7
14570 changed files with 153136 additions and 63871 deletions
|
|
@ -1,5 +1,5 @@
|
|||
// Note: this function modifies the input list
|
||||
public static double median(List<Double> list){
|
||||
Collections.sort(list);
|
||||
return (list.get(list.size() / 2) + list.get((list.size() - 1) / 2)) / 2;
|
||||
public static double median(List<Double> list) {
|
||||
Collections.sort(list);
|
||||
return (list.get(list.size() / 2) + list.get((list.size() - 1) / 2)) / 2;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -1,10 +1,10 @@
|
|||
public static double median2(List<Double> list){
|
||||
PriorityQueue<Double> pq = new PriorityQueue<Double>(list);
|
||||
int n = list.size();
|
||||
for (int i = 0; i < (n-1)/2; i++)
|
||||
pq.poll(); // discard first half
|
||||
if (n % 2 != 0) // odd length
|
||||
return pq.poll();
|
||||
else
|
||||
return (pq.poll() + pq.poll()) / 2.0;
|
||||
public static double median2(List<Double> list) {
|
||||
PriorityQueue<Double> pq = new PriorityQueue<Double>(list);
|
||||
int n = list.size();
|
||||
for (int i = 0; i < (n - 1) / 2; i++)
|
||||
pq.poll(); // discard first half
|
||||
if (n % 2 != 0) // odd length
|
||||
return pq.poll();
|
||||
else
|
||||
return (pq.poll() + pq.poll()) / 2.0;
|
||||
}
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue