On: Fast median search: an ANSI C implementation

[sp332]

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

[andrewcooke → sp332]

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.