Rearrange array such that even index elements are smaller and odd index elements are greater
Last Updated :
31 Mar, 2023
Given an array, rearrange the array such that :
- If index i is even, arr[i] <= arr[i+1]
- If index i is odd, arr[i] >= arr[i+1]
Note: There can be multiple answers.
Examples:
Input : arr[] = {2, 3, 4, 5}
Output : arr[] = {2, 4, 3, 5}
Explanation : Elements at even indexes are
smaller and elements at odd indexes are greater
than their next elements
Note : Another valid answer
is arr[] = {3, 4, 2, 5}
Input :arr[] = {6, 4, 2, 1, 8, 3}
Output :arr[] = {4, 6, 1, 8, 2, 3}
This problem is similar to sorting an array in the waveform.
- A simple solution is to sort the array in decreasing order, then starting from the second element, swap the adjacent elements.
- An efficient solution is to iterate over the array and swap the elements as per the given condition.
If we have an array of length n, then we iterate from index 0 to n-2 and check the given condition.
At any point of time if i is even and arr[i] > arr[i+1], then we swap arr[i] and arr[i+1]. Similarly, if i is odd and
arr[i] < arr[i+1], then we swap arr[i] and arr[i+1].
For the given example:
Before rearrange, arr[] = {2, 3, 4, 5}
Start iterating over the array till index 2 (as n = 4)
First Step:
At i = 0, arr[i] = 2 and arr[i+1] = 3. As i is even and arr[i] < arr[i+1], don't need to swap.
Second step:
At i = 1, arr[i] = 3 and arr[i+1] = 4. As i is odd and arr[i] < arr[i+1], swap them.
Now arr[] = {2, 4, 3, 5}
Third step:
At i = 2, arr[i] = 3 and arr[i+1] = 5. So, don't need to swap them
After rearrange, arr[] = {2, 4, 3, 5}
Flowchart
Flowchart
Implementation:
C++
// CPP code to rearrange an array such that
// even index elements are smaller and odd
// index elements are greater than their
// next.
#include <iostream>
using namespace std;
void rearrange(int* arr, int n)
{
for (int i = 0; i < n - 1; i++) {
if (i % 2 == 0 && arr[i] > arr[i + 1])
swap(arr[i], arr[i + 1]);
if (i % 2 != 0 && arr[i] < arr[i + 1])
swap(arr[i], arr[i + 1]);
}
}
/* Utility that prints out an array in
a line */
void printArray(int arr[], int size)
{
for (int i = 0; i < size; i++)
cout << arr[i] << " ";
cout << endl;
}
/* Driver function to test above functions */
int main()
{
int arr[] = { 6, 4, 2, 1, 8, 3 };
int n = sizeof(arr) / sizeof(arr[0]);
cout << "Before rearranging: \n";
printArray(arr, n);
rearrange(arr, n);
cout << "After rearranging: \n";
printArray(arr, n);
return 0;
}
// Java code to rearrange an array such
// that even index elements are smaller
// and odd index elements are greater
// than their next.
class GFG {
static void rearrange(int arr[], int n)
{
int temp;
for (int i = 0; i < n - 1; i++) {
if (i % 2 == 0 && arr[i] > arr[i + 1]) {
temp = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = temp;
}
if (i % 2 != 0 && arr[i] < arr[i + 1]) {
temp = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = temp;
}
}
}
/* Utility that prints out an array in
a line */
static void printArray(int arr[], int size)
{
for (int i = 0; i < size; i++)
System.out.print(arr[i] + " ");
System.out.println();
}
// Driver code
public static void main(String[] args)
{
int arr[] = { 6, 4, 2, 1, 8, 3 };
int n = arr.length;
System.out.print("Before rearranging: \n");
printArray(arr, n);
rearrange(arr, n);
System.out.print("After rearranging: \n");
printArray(arr, n);
}
}
// This code is contributed by Anant Agarwal.
# Python code to rearrange
# an array such that
# even index elements
# are smaller and odd
# index elements are
# greater than their
# next.
def rearrange(arr, n):
for i in range(n - 1):
if (i % 2 == 0 and arr[i] > arr[i + 1]):
temp = arr[i]
arr[i]= arr[i + 1]
arr[i + 1]= temp
if (i % 2 != 0 and arr[i] < arr[i + 1]):
temp = arr[i]
arr[i]= arr[i + 1]
arr[i + 1]= temp
# Utility that prints out an array in
# a line
def printArray(arr, size):
for i in range(size):
print(arr[i], " ", end ="")
print()
# Driver code
arr = [ 6, 4, 2, 1, 8, 3 ]
n = len(arr)
print("Before rearranging: ")
printArray(arr, n)
rearrange(arr, n)
print("After rearranging:")
printArray(arr, n);
# This code is contributed
# by Anant Agarwal.
// C# code to rearrange an array such
// that even index elements are smaller
// and odd index elements are greater
// than their next.
using System;
class GFG {
static void rearrange(int[] arr, int n)
{
int temp;
for (int i = 0; i < n - 1; i++) {
if (i % 2 == 0 && arr[i] > arr[i + 1])
{
temp = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = temp;
}
if (i % 2 != 0 && arr[i] < arr[i + 1])
{
temp = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = temp;
}
}
}
/* Utility that prints out an array in
a line */
static void printArray(int[] arr, int size)
{
for (int i = 0; i < size; i++)
Console.Write(arr[i] + " ");
Console.WriteLine();
}
// Driver code
public static void Main()
{
int[] arr = { 6, 4, 2, 1, 8, 3 };
int n = arr.Length;
Console.WriteLine("Before rearranging: ");
printArray(arr, n);
rearrange(arr, n);
Console.WriteLine("After rearranging: ");
printArray(arr, n);
}
}
// This code is contributed by vt_m.
<?php
// PHP code to rearrange an array such
// that even index elements are smaller
// and odd index elements are greater
// than their next.
function swap(&$a, &$b)
{
$temp = $a;
$a = $b;
$b = $temp;
}
function rearrange(&$arr, $n)
{
for ($i = 0; $i < $n - 1; $i++)
{
if ($i % 2 == 0 &&
$arr[$i] > $arr[$i + 1])
swap($arr[$i], $arr[$i + 1]);
if ($i % 2 != 0 &&
$arr[$i] < $arr[$i + 1])
swap($arr[$i], $arr[$i + 1]);
}
}
/* Utility that prints out
an array in a line */
function printArray(&$arr, $size)
{
for ($i = 0; $i < $size; $i++)
echo $arr[$i] . " ";
echo "\n";
}
// Driver Code
$arr = array(6, 4, 2, 1, 8, 3 );
$n = sizeof($arr);
echo "Before rearranging: \n";
printArray($arr, $n);
rearrange($arr, $n);
echo "After rearranging: \n";
printArray($arr, $n);
// This code is contributed
// by ChitraNayal
?>
<script>
// JavaScript code to rearrange an array such that
// even index elements are smaller and odd
// index elements are greater than their
// next.
let rearrange = (arr, n)=>{
for (let i = 0; i < n - 1; i++) {
if (i % 2 == 0 && arr[i] > arr[i + 1]){
// swap(arr[i], arr[i + 1]);
let temp = arr[i];
arr[i] = arr[i+1];
arr[i+1] = temp;
}
if (i % 2 != 0 && arr[i] < arr[i + 1]){
// swap(arr[i], arr[i + 1]);
let temp = arr[i];
arr[i] = arr[i+1];
arr[i+1] = temp;
}
}
}
// function to print array
let printArray = (arr, size)=>{
ans = '';
for (let i = 0; i < size; i++){
ans += arr[i] + " ";
}
document.write(ans);
}
// Driver Code
let arr = [ 6, 4, 2, 1, 8, 3 ];
let n = arr.length;
document.write("Before rearranging: ");
printArray(arr, n);
rearrange(arr, n);
document.write("<br>");
document.write("After rearranging: ");
printArray(arr, n);
</script>
OutputBefore rearranging:
6 4 2 1 8 3
After rearranging:
4 6 1 8 2 3
Time Complexity: O(N), as we are using a loop to traverse N times,
Auxiliary Space: O(1), as we are not using any extra space.
Approach: Sort and Swap Adjacent Elements
The "Sort and Swap Adjacent Elements" approach for rearranging an array such that even index elements are smaller and odd index elements are greater can be summarized in the following steps:
- Sort the input array in non-decreasing order.
- Iterate over the array using a step of 2 to access the odd-indexed elements.
- For each odd-indexed element, swap it with the next even-indexed element to meet the required condition.
- Return the rearranged array.
Here are the detailed steps with an example:
Input: arr = [2, 3, 4, 5]
- Sort the input array in non-decreasing order. The sorted array is: [2, 3, 4, 5].
- Iterate over the array using a step of 2 to access the odd-indexed elements. The odd-indexed elements are arr[1] and arr[3].
- For each odd-indexed element, swap it with the next even-indexed element to meet the required condition. We swap arr[1] with arr[2] to get the array [2, 4, 3, 5].
- Return the rearranged array [2, 4, 3, 5].
C++
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<int> rearrange_array(vector<int>& arr)
{
sort(arr.begin(), arr.end());
for (int i = 1; i < arr.size() - 1; i += 2) {
swap(arr[i], arr[i + 1]);
}
return arr;
}
// Driver code
int main()
{
vector<int> arr = { 2, 3, 4, 5 };
vector<int> rearranged_arr = rearrange_array(arr);
for (int i = 0; i < rearranged_arr.size(); i++) {
cout << rearranged_arr[i] << " ";
}
// Output: 2 4 3 5
return 0;
}
import java.util.Arrays;
public class Main {
public static void main(String[] args) {
int[] arr = {2, 3, 4, 5};
int[] rearrangedArr = rearrangeArray(arr);
System.out.println(Arrays.toString(rearrangedArr)); // Output: [2, 4, 3, 5]
}
public static int[] rearrangeArray(int[] arr) {
Arrays.sort(arr);
for (int i = 1; i < arr.length - 1; i += 2) {
int temp = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = temp;
}
return arr;
}
}
def rearrange_array(arr):
arr.sort()
for i in range(1, len(arr)-1, 2):
arr[i], arr[i+1] = arr[i+1], arr[i]
return arr
#Example
arr = [2, 3, 4, 5]
rearranged_arr = rearrange_array(arr)
print(rearranged_arr) # Output: [2, 4, 3, 5]
using System;
using System.Collections.Generic;
class Program {
// Rearranges the elements of the input list in a
// specific way.
static List<int> RearrangeArray(List<int> arr)
{
// Sort the input list in ascending order.
arr.Sort();
// Swap adjacent elements starting from the second
// element.
for (int i = 1; i < arr.Count - 1; i += 2) {
int temp = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = temp;
}
// Return the rearranged list.
return arr;
}
static void Main(string[] args)
{
// Create a new list of integers.
List<int> arr = new List<int>{ 2, 3, 4, 5 };
// Rearrange the elements of the list.
List<int> rearrangedArr = RearrangeArray(arr);
// Print the rearranged list.
foreach(int i in rearrangedArr)
{
Console.Write(i + " ");
}
// Output: 2 4 3 5
}
}
// JavaScript program for the above approach
function rearrangeArray(arr) {
// Sort the input array in ascending order.
arr.sort((a, b) => a - b);
// Swap adjacent elements starting from the second
// element.
for (let i = 1; i < arr.length - 1; i += 2) {
let temp = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = temp;
}
// Return the rearranged array.
return arr;
}
// Create a new array of integers.
let arr = [2, 3, 4, 5];
// Rearrange the elements of the array.
let rearrangedArr = rearrangeArray(arr);
// Print the rearranged array.
console.log(rearrangedArr.join(' '));
// Output: 2 4 3 5
The time complexity of the "Sort and Swap Adjacent Elements" approach for rearranging an array such that even index elements are smaller and odd index elements are greater is O(n log n),
The auxiliary space of this approach is O(1).
Similar Reads
Rearrange sorted array such that all odd indices elements comes before all even indices element
Given a sorted array arr[] consisting of N positive integers, the task is to rearrange the array such that all the odd indices elements come before all the even indices elements. Examples: Input: arr[] = {1, 2, 3, 4, 5, 6, 7, 8, 9}Output: 2 4 6 8 1 3 5 7 9 Input: arr[] = {0, 3, 7, 7, 10}Output: 3 7
12 min read
Rearrange array such that all even-indexed elements in the Array is even
Given an array arr[], the task is to check if it is possible to rearrange the array in such a way that every even index(1-based indexing) contains an even number. If such a rearrangement is not possible, print "No". Otherwise, print "Yes" and print a possible arrangement Examples: Input: arr[] = {2,
6 min read
Rearrange an array such that every odd indexed element is greater than it previous
Given an unsorted array, rearrange the array such that the number at the odd index is greater than the number at the previous even index. There may be multiple outputs, we need to print one of them. Note: Indexing is based on an array, so it always starts from 0. Examples: Input : arr[] = {5, 2, 3,
7 min read
Find the Array Permutation having sum of elements at odd indices greater than sum of elements at even indices
Given an array arr[] consisting of N integers, the task is to find the permutation of array elements such that the sum of odd indices elements is greater than or equal to the sum of even indices elements. Examples: Input: arr[] = {1, 2, 3, 4}Output: 1 4 2 3 Explanation:Consider the permutation of th
6 min read
Rearrange Array to minimize difference of sum of squares of odd and even index elements
Given an array arr[] of size N (multiple of 8) where the values in the array will be in the range [a, (a+8*N) -1] (a can be any positive integer), the task is to rearrange the array in a way such that the difference between the sum of squares at odd indices and sum of squares of the elements at even
15+ min read
Modify Array such that no element is smaller/greater than half/double of its adjacent elements
Given an array, arr[] of size N. Find the minimum number of elements we need to insert between array elements such that the maximum element from two adjacent elements is not more than twice bigger than the minimum element i.e., max(arr[i], arr[i+1]) ? 2 * min(arr[i], arr[i+1]) where 0 ? i < N - 1
7 min read
Rearrange array elements such that Bitwise AND of first N - 1 elements is equal to last element
Given an array arr[] of N positive integers, the task is to find an arrangement such that Bitwise AND of the first N - 1 elements is equal to the last element. If no such arrangement is possible then output will be -1.Examples: Input: arr[] = {1, 5, 3, 3} Output: 3 5 3 1 (3 & 5 & 3) = 1 whic
7 min read
Rearrange array such that even positioned are greater than odd
Given an array arr[], sort the array according to the following relations: arr[i] >= arr[i - 1], if i is even, ∀ 1 <= i < narr[i] <= arr[i - 1], if i is odd, ∀ 1 <= i < nFind the resultant array.[consider 1-based indexing]Examples: Input: arr[] = [1, 2, 2, 1]Output: [1 2 1 2] Expla
9 min read
Rearrange the Array to maximize the elements which is smaller than both its adjacent elements
Given an array arr[] consisting of N distinct integers, the task is to rearrange the array elements such that the count of elements that are smaller than their adjacent elements is maximum. Note: The elements left of index 0 and right of index N-1 are considered as -INF. Examples: Input: arr[] = {1,
7 min read
Rearrange given Array such that each element raised to its index is odd
Given an array arr of length N, the task is to rearrange the elements of given array such that for each element, its bitwise XOR with its index is an odd value. If no rearrangement is possible return -1. Example: Input: arr[] = {1 2 4 3 5}Output: 1 2 3 4 5Explanation: In the above array:for 1st elem
13 min read