
but that's not much help because I don't know which algorithm. Seems like one bee swaps a flower with the other bee... a certain flower. Using mysterious bee intuition to choose which one.
( ,
Mon 18 Jul 2011, 19:12,
archived)

I've tentatively called it Split Sort. The array is split exactly in half, the bottom half is built up into a max heap and the top half is built into a min heap, but with extra swaps so that the max of the max heap ends up less than the min of the min heap. Then it recurses. So it's kind of like Quicksort except instead of taking a guess at the median, it works it out exactly.
( ,
Mon 18 Jul 2011, 19:16,
archived)