Search:

You're right, I'm not bothering with merge sort. The target list is not mergable anyway. Only one operation allowed. Also, "fewer comparisons" is not an issue, as the comparison operation is...

Well... yes and no. I fetch the list from web, can use extra storage for _temporary_ work and then store the result back "in-place-wise". So conventional efficiency measurements (O-notation) don't...

No way to edit posts here? There's obviously a contradiction in my definition of the operation and the example.

The operation is better defined as:
-Move an item X to the slot after item Y, or...

I need a sorting algorithm which operates on a single, pre-populated array, and which is limited to perform only one operation:

-Move an item to position P, pushing all elements from position P+X...