You don't implement bubble sort if you're worried about efficiency. A+

Wow! I just figured a selection sort would be the best way to go.

http://steamproxy.com/sharedfiles/filedetails/?id=707303498

This looks really complicated. But why did you do the bubblesort for the maximum values? (I know that's what the name suggests but when "bubbling down" the min values you could get rid of those as you can move them to the output.)
I did that and had 2412 cycles / 8 nodes / 56 instructions.
One trick was to push a 0 to the stack first then I always knew when I was taking the last value from stack... (which makes it way easier)

This doesn't work for sequences of 1 or 0 length....
I.E. a sequence of just 0 or a sequence of 1 number and a 0

I solved this with an almost equally complicated insertion sort. http://steamproxy.com/sharedfiles/filedetails/?id=461653903