β Wavy Array
a1 >= a2 <= a3 >= a4 <= a5.....
Using Sorting and Swap Alternate (Most Optimal)
vector<int> Solution::wave(vector<int> &A) {
sort(A.begin(), A.end());
for(int i = 0; i + 1 < A.size(); i += 2)
swap(A[i], A[i + 1]);
return A;
}
Time Complexity: β
Space Complexity: β
Last updated