Hi,
Attached is a rather unusual approach to programming in pd: It implements quicksort by capturing the state of a recursion in a command queue (realized with a textfile object). It's hopelessly inefficient but I thought the concept might be interesting to share.
I just saw list-drip from pd-extended (I work with vanilla). Is there any reason, why it is so complicated? I have always used the attached list-drip, which I made a couple of years ago. Can someone comment on that? I'm just trying to make sure my object doesn't screw up in some corner cases... (although it hasn't failed on me yet ;-)
-- Orm