# Wiggle Sort

Given an unsorted array `nums`

, reorder it in-place such that `nums[0] <= nums[1] >= nums[2] <= nums[3]...`

Example

Given `nums = [3, 5, 2, 1, 6, 4]`

, one possible answer is `[1, 6, 2, 5, 3, 4]`

.

The following uses shifting approach and the time complexity is O(n^{2}).