{"post":"

C++ program to sort a given unsorted array of integers, in a waveform

Given: An unsorted array of integers, we have to sort the array into a wave-like array.

An array array[0….n-1] is sorted in wave form if array[0] >= array[1] <= array[2] >= array[3] <= array[4] >= array[5]…

Example:

Input: {4, 12, 15, 2, 20, 30, 21}

Output: {4 2 15 12 21 20 30}

# Algorithm

Take an array input.
Check if the array is empty or has only one element. If so, return the array as it is.
Sort the array using the sort() function.
Iterate through the array in pairs (i.e., with a step size of 2). For each pair, swap the elements if the first element is larger than the second element.
Print the modified array.

Code:

#include <iostream>\n#include <algorithm>\n\nusing namespace std;\n\nvoid swap(int* p, int* q) {\n  int temp = *p;\n  *p = *q;\n  *q = temp;\n}\n\nvoid array_in_wave(int array[], int n) {\n  sort(array, array + n);\n  for (int i = 0; i < n - 1; i += 2)\n    swap(&array[i], &array[i + 1]);\n}\n\nint main() {\n  int array[100], n, i;\n  cout << \"Enter number of elements: \";\n  cin >> n;\n  cout << \"\\nEnter elements: \";\n\n  for (i = 0; i < n; i++)\n    cin >> array[i];\n\n  cout << \"Original array: \";\n\n  for (int i = 0; i < n; i++)\n    cout << array[i] << \" \";\n\n  array_in_wave(array, n);\n\n  cout << \"\\nWave form of the array is: \";\n\n  for (int i = 0; i < n; i++)\n    cout << array[i] << \" \";\n\n  return 0;\n}\n\n

Output

Original array: 1 2 3 4 5\nWave form of the array is: 2 1 4 3 5\n

\n","title":"Program to sort a given unsorted array in wave form in C++","authorDetails":{"name":"Prabhnoor Maingi","slug":"prabhnoor-maingi"},"description":"Learn how to sort an unsorted array in wave form using C++. This program uses a simple iteration through the array to swap adjacent elements and achieve the desired waveform pattern.","slug":"cpp/examples/program-to-sort-unsorted-array-in-wave-form/","articleId":"636a83417bb1ce5072622b3e","bookmarkStatus":{"isBookmarked":false,"bookmarkId":null}}