> without sorting it... have a fixed size sorted buffer (that you sort yourself) | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		rendaw on Sept 15, 2021 \| parent \| context \| favorite \| on: How percentile approximation works and why it's mo... > without sorting it... have a fixed size sorted buffer (that you sort yourself)

raxxorrax on Sept 15, 2021 [–]

That doesn't really make sense to me at all. Don't sort it, just have it?

Is the storage restriction the point?

panda88888 on Sept 16, 2021 | [–]

Yes. The goal is to find (or approximate) the median without storing all the elements. Instead, it approximates the median by finding the median of randomly selected samples from the elements.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact