Chad Netzer skrev: > My current plan of attack is to deliver a partition() function that > basically returns an array such that elements less than the pivot(s) > come first, then the pivot(s), then the elements greater than the > pivot(s).
I'm actually trying to write a fast median replacement myself. I was thinking in the same lines, except I don't store those two arrays. I just keep track of counts in them. For the even case, I also keep track the elements closest to the pivot (smaller and bigger). It's incredibly simple actually. So lets see who gets there first :-) Sturla Molden _______________________________________________ NumPy-Discussion mailing list NumPy-Discussion@scipy.org http://mail.scipy.org/mailman/listinfo/numpy-discussion
