Ordered data? Lookups into sorted data can use a binary search and are only O(lo... | Hacker News

Hacker News new | past | comments | ask | show | jobs | submit

login

sp332 on May 18, 2013 | parent | context | favorite | on: Fast median search: an ANSI C implementation

Ordered data? Lookups into sorted data can use a binary search and are only O(log n).

andrewcooke on May 18, 2013 [–]

but you need to move n/2 to "make room" - think of the whole process.

edit: you're not wrong, but what i am saying is that to make the filter practical you have to save the new point, too.

sorry for brief comments. on vacn w tablet only.

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