News for hackers. Stuff that matters.
Re:The Median of a Trillion Numbers by eru on Monday August 24, 2009 @05:09AM (#781791)
Calculating the average is in O(n). Calculating the median is in O(n).
Re:The Median of a Trillion Numbers by roundsquare on Monday August 24, 2009 @05:23AM (#781808)
Actually, even be worse here. E.g. if all the numbers are positive you will get an overflow pretty quick, so you'll need a better datatype. So if you are dealing with b-bit numbers you'd need O(n * log(bn)) to calculate the average.

(Usually this doesn't matter, but since n >> b it does).

Edit: Notwithstanding my earlier comment that average doesn't work, merely commenting on the run time of average.

Re:The Median of a Trillion Numbers by bravura on Monday August 24, 2009 @02:33PM (#782885)
Or, you could compute the average as follows:

    m <-- m - (1/t) (m - x_t)
This will compute the exact historical average. I like to use 2/t instead of 1/t to get a moving average over a non-stationary distribution, which favors the more recent events.
Re:The Median of a Trillion Numbers by eru on Monday August 24, 2009 @04:17PM (#783209)
Please keep numerical errors in mind. They accumulate.