ENH: Implementation based on counting sort
rheineke opened this issue · 1 comments
rheineke commented
For integral types (or objects that support an integral hash?), a running median can be calculated using counting sort. It requires auxiliary storage space, and seems to run in linear time, but linear in keys rather than items (verify).