Quick Sort Wiggle Sort II Question: http://www.lintcode.com/en/problem/wiggle-sort-ii/ Given an unsorted array nums, reorder it such that nums[0] < nums[1] > nums[2] < nums[3].... Answer: class Solution { public: /* * @param nums: A list of integers * @return: nothing */ inline int partion(vector&
Quick Sort Wiggle Sort Question: http://www.lintcode.com/en/problem/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,
Quick Sort Kth Largest Element Question: http://www.lintcode.com/en/problem/kth-largest-element/ Find K-th largest element in an array. You can swap elements in the array. Answer: class Solution { public: /* * @param n: An integer * @param nums: An array * @return: the Kth largest element */ inline void qsort(vector<