Skip to content

Instantly share code, notes, and snippets.

@caseyjustus
Created August 23, 2011 19:34
Show Gist options
  • Save caseyjustus/1166258 to your computer and use it in GitHub Desktop.
Save caseyjustus/1166258 to your computer and use it in GitHub Desktop.
calculate the median of an array with javascript
function median(values) {
values.sort( function(a,b) {return a - b;} );
var half = Math.floor(values.length/2);
if(values.length % 2)
return values[half];
else
return (values[half-1] + values[half]) / 2.0;
}
var list1 = [3, 8, 9, 1, 5, 7, 9, 21];
median(list1);
@namcoder
Copy link

nice !

@sorenlouv
Copy link

sorenlouv commented Nov 13, 2018

Similar to lodash.math but without the custom sort method and a little more readable (in my opinion):

function median(numbers) {
  const middle = (numbers.length + 1) / 2;
  const sorted = [...numbers].sort((a, b) => a - b); // avoid mutating when sorting
  const isEven = sorted.length % 2 === 0;
  return isEven ? (sorted[middle - 1.5] + sorted[middle - 0.5]) / 2 : sorted[middle - 1];
}

EDIT: fixed as per @henrikra's comment.

@zimejin
Copy link

zimejin commented Nov 27, 2018

@sqren, Thanks, worked like a charm.

@henrikra
Copy link

henrikra commented Feb 16, 2019

@sqren Otherwise you answer was good but the number sorting didn't work

This version will work!

function median(numbers: number[]) {
  const middle = (numbers.length + 1) / 2;
  const sorted = [...numbers].sort((a, b) => a - b); // you have to add sorting function for numbers
  const isEven = sorted.length % 2 === 0;
  return isEven ? (sorted[middle - 1.5] + sorted[middle - 0.5]) / 2 : sorted[middle - 1];
}

@danielbayerlein
Copy link

@henrikra + @sqren

I think [...numbers] is pointless, because numbers is already an array. Please correct me if I am wrong.

@sorenlouv
Copy link

sorenlouv commented Apr 29, 2019

@danielbayerlein sort will mutate the array. I used the spread operator to instead return a new shallow copy. Before the spread operator concat and slice did the trick:

arr.concat().sort()
# or
arr.slice(0).sort()

Some more discussion on this topic https://stackoverflow.com/questions/9592740/how-can-you-sort-an-array-without-mutating-the-original-array

@danielbayerlein
Copy link

@sqren Thank you for the explanation.

@sorenlouv
Copy link

@danielbayerlein You are welcome.
Btw. Noticed your project https://github.com/danielbayerlein/git-pick. I've create a tool called backport: https://github.com/sqren/backport

Looks like we are doing something similar :D

@PrimeGurjar
Copy link

I would also check the length first. if it is zero return. no need to proceed further.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment