Wiggle sort
Your task
Reorder an integer array into a 'wiggle' arrangement satisfying nums[0] <= nums[1] >= nums[2] <= nums[3] >= ... and return it. The given reference produces a canonical wiggle by a single left-to-right pass that swaps each adjacent pair whenever it violates the alternating relation at that position. Duplicates are allowed; the array has length >= 1.
Examples
wiggle_sort(nums: list[int]) -> list[int]Example 1
Input
wiggle_sort([3, 5, 2, 1, 6, 4])Output
[3, 5, 1, 6, 2, 4]