Based on Perreault + Hebert, here's python code for a rather different algorithm: - for quantized e.g. 8-bit data - runs faster for wider windows / slowly changing medians - no heaps, no trees: the only import is numpy, and even that's not essential
http://stackoverflow.com/questions/1309263/rolling-median-algorithm-in-c cheers -- denis -- http://mail.python.org/mailman/listinfo/python-list
