🔄 Shifting Arrangement

Shifting Arrangement

In Shifting Arrangement, instead of picking an element and placing it at a fixed end, the machine shifts elements through the sequence. The element "bubbles" through adjacent positions until it reaches its correct spot.

This is slightly harder than Fixed because elements move through the middle of the sequence.

---

How Shifting Works

At each step:

1. The machine identifies the next element to sort (e.g., the current smallest)
2. That element shifts position by position to its correct spot
3. Other elements shift by one position to make room
4. This continues until the full arrangement is complete

---

Solved Example: Ascending Shifting

Input: 24 27 83 76 12 18 61 75

The machine sorts numbers in ascending order by shifting the smallest unsorted number to its correct position:

Step	Arrangement	What happened
Input	24 27 83 76 12 18 61 75	12 needs to go to position 1
Step 1	12 24 27 83 76 18 61 75	12 shifted from pos 5 to pos 1
Step 2	12 18 24 27 83 76 61 75	18 shifted from pos 6 to pos 2
Step 3	12 18 24 27 83 76 61 75	27 was already at pos 4 (minor shift)
Step 4	12 18 24 27 61 83 76 75	61 shifted to pos 5
Step 5	12 18 24 27 61 75 83 76	75 shifted to pos 6
Step 6	12 18 24 27 61 75 76 83	76 shifted to pos 7

Key difference from Fixed: In shifting, when the element moves, all elements between its old and new position shift by one. In fixed, the selected element is extracted and placed at the end while others maintain relative order.