Convert Array into Zig-Zag fashion
Last Updated :
23 Jul, 2025
Given an array of distinct elements of size N, the task is to rearrange the elements of the array in a zig-zag fashion, i.e., the elements are arranged as smaller, then larger, then smaller, and so on. There can be more than one arrangement that follows the form:
arr[0] < arr[1] > arr[2] < arr[3] > arr[4] < ...
Examples:
Input: N = 7, arr[] = [4, 3, 7, 8, 6, 2, 1]
Output: [3, 7, 4, 8, 2, 6, 1]
Explanation: The given array is in zig-zag pattern as we can see 3 < 7 > 4 < 8 > 2 < 6 >1
Input: N = 4, arr[] = [1, 4, 3, 2]
Output: [1, 4, 2, 3]
[Naive Approach] Using Sorting - O(N*log(N)) time and O(1) Space
The most basic approach is to solve this with the help of Sorting. The idea is to sort the array first and then swap adjacent elements (from 1st index) to make the array as zig-zag array.
Code Implementation:
C++
#include <bits/stdc++.h>
using namespace std;
void zigZag(vector<int>& arr, int N)
{
// sort the array by using the sort function
sort(arr.begin(), arr.end());
// traverse the array from 1 to N -1
for (int i = 1; i < N - 1; i += 2) {
// swap the current element with the next element
swap(arr[i], arr[i + 1]);
}
// print the complete array
for (int i = 0; i < N; i++) {
cout << arr[i] << " ";
}
return;
}
int main()
{
vector<int> arr = { 4, 3, 7, 8, 6, 2, 1 };
int N = 7;
zigZag(arr, N);
return 0;
}
#include <stdio.h>
#include <stdlib.h>
int comparator(const void* p, const void* q)
{
return (*(int*)p - *(int*)q);
}
void zigZag(int arr[], int N)
{
// sort the array using the qsort function
qsort((void*)arr, N, sizeof(arr[0]), comparator);
for (int i = 1; i < N - 1; i += 2) {
// swap the value of current element with next
// element
int temp = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = temp;
}
// print the complete array
for (int i = 0; i < N; i++)
printf("%d ", arr[i]);
return;
}
int main()
{
int arr[] = { 2, 3, 4, 1, 5, 7, 6 };
int N = 7;
zigZag(arr, N);
return 0;
}
// Java program to sort an array in Zig-Zag form
import java.util.Arrays;
class Test {
static int arr[] = new int[] { 4, 3, 7, 8, 6, 2, 1 };
static void zigZag()
{
// sort the array using the sort function
Arrays.sort(arr);
// traverse the array from 1 to N -1
for (int i = 1; i <= arr.length - 2; i += 2) {
// swap the current element with the next
// element
int temp = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = temp;
}
}
// Driver method to test the above function
public static void main(String[] args)
{
zigZag();
// print the complete array
System.out.println(Arrays.toString(arr));
}
}
def zigZag(arr, n):
# use sort function to sort the array
arr.sort()
# traverse the array from 1 to n-1
for i in range(1, n-1, 2):
# swap value of current element with next element
arr[i], arr[i+1] = arr[i+1], arr[i]
# print the array
print(arr)
# Driver program
if __name__ == "__main__":
arr = [4, 3, 7, 8, 6, 2, 1]
n = len(arr)
zigZag(arr, n)
// C# program to sort an array in Zig-Zag form
using System;
class GFG {
static int[] arr = new int[] { 4, 3, 7, 8, 6, 2, 1 };
// Method for zig-zag conversion of array
static void zigZag()
{
// sort the array by using the sort function
Array.Sort(arr);
for (int i = 1; i <= arr.Length - 2; i += 2) {
// swap the current element with next next
// element
int temp = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = temp;
}
}
// Driver code
public static void Main(String[] args)
{
zigZag();
// print the array
foreach(int i in arr) Console.Write(i + " ");
}
}
<script>
// JavaScript program to sort an array
// in Zig-Zag form
// Program for zig-zag conversion of array
function zigZag(arr, n)
{
// sort the by using the sort function
arr.sort();
//traverse the array from 1 to n-1
for(let i = 1; i <= n - 2; i++)
{
// swap the current element with next element
let temp = arr[i];
arr[i] = arr[i+1];
arr[i+1] = temp;
}
}
// Driver code
let arr = [ 4, 3, 7, 8, 6, 2, 1 ];
let n = arr.length;
zigZag(arr, n);
// print the array
for(let i = 0; i < n; i++)
document.write(arr[i] + " ");
// This code is contributed by Surbhi Tyagi.
</script>
Time complexity: O(N*log(N)), because sorting is used.
Auxiliary Space: O(1)
[Expected Approach] Rearranging Triplets using Flag - O(N) time and O(1) Space
The most efficient and expected approach is to use the triplet relation of zig-zag array, i.e. arr[i-1] < arr[i] > arr[i+1].
The idea is that for each triplet, the middle element should be greater than its adjacent neighbours. So, for each triplet:
- First check the left neighbour with the middle element. If middle is smaller, swap the elements.
- Then check the middle with right neighbour. If middle is smaller, swap the elements.
- Repeat the process till complete array is traversed.
Code Implementation:
C++
// C++ program to sort an array in Zig-Zag form
#include <iostream>
using namespace std;
// Program for zig-zag conversion of array
void zigZag(int arr[], int n)
{
// Flag true indicates relation "<" is expected,
// else ">" is expected. The first expected relation
// is "<"
bool flag = true;
for (int i = 0; i <= n - 2; i++) {
if (flag) /* "<" relation expected */
{
/* If we have a situation like A > B > C,
we get A > C < B by swapping B and C */
if (arr[i] > arr[i + 1])
swap(arr[i], arr[i + 1]);
}
else /* ">" relation expected */
{
/* If we have a situation like A < B < C,
we get A < C > B by swapping B and C */
if (arr[i] < arr[i + 1])
swap(arr[i], arr[i + 1]);
}
flag = !flag; /* flip flag */
}
}
// Driver program
int main()
{
int arr[] = { 4, 3, 7, 8, 6, 2, 1 };
int n = sizeof(arr) / sizeof(arr[0]);
zigZag(arr, n);
for (int i = 0; i < n; i++)
cout << arr[i] << " ";
return 0;
}
// This code is contributed by Sania Kumari Gupta
// (kriSania804)
// C program to sort an array in Zig-Zag form
#include <stdbool.h>
#include <stdio.h>
// This function swaps values pointed by xp and yp
void swap(int* xp, int* yp)
{
int temp = *xp;
*xp = *yp;
*yp = temp;
}
// Program for zig-zag conversion of array
void zigZag(int arr[], int n)
{
// Flag true indicates relation "<" is expected,
// else ">" is expected. The first expected relation
// is "<"
bool flag = true;
for (int i = 0; i <= n - 2; i++) {
if (flag) /* "<" relation expected */
{
/* If we have a situation like A > B > C,
we get A > C < B by swapping B and C */
if (arr[i] > arr[i + 1])
swap(&arr[i], &arr[i + 1]);
}
else /* ">" relation expected */
{
/* If we have a situation like A < B < C,
we get A < C > B by swapping B and C */
if (arr[i] < arr[i + 1])
swap(&arr[i], &arr[i + 1]);
}
flag = !flag; /* flip flag */
}
}
// Driver program
int main()
{
int arr[] = { 4, 3, 7, 8, 6, 2, 1 };
int n = sizeof(arr) / sizeof(arr[0]);
zigZag(arr, n);
for (int i = 0; i < n; i++)
printf("%d ", arr[i]);
return 0;
}
// This code is contributed by Sania Kumari Gupta
// (kriSania804)
// Java program to sort an array in Zig-Zag form
import java.util.Arrays;
class Test {
static int arr[] = new int[] { 4, 3, 7, 8, 6, 2, 1 };
// Method for zig-zag conversion of array
static void zigZag()
{
// Flag true indicates relation "<" is expected,
// else ">" is expected. The first expected relation
// is "<"
boolean flag = true;
int temp = 0;
for (int i = 0; i <= arr.length - 2; i++) {
if (flag) /* "<" relation expected */
{
/* If we have a situation like A > B > C,
we get A > C < B by swapping B and C */
if (arr[i] > arr[i + 1]) {
// swap
temp = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = temp;
}
}
else /* ">" relation expected */
{
/* If we have a situation like A < B < C,
we get A < C > B by swapping B and C */
if (arr[i] < arr[i + 1]) {
// swap
temp = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = temp;
}
}
flag = !flag; /* flip flag */
}
}
// Driver method to test the above function
public static void main(String[] args)
{
zigZag();
System.out.println(Arrays.toString(arr));
}
}
# Python program to sort an array in Zig-Zag form
# Program for zig-zag conversion of array
def zigZag(arr, n):
# Flag true indicates relation "<" is expected,
# else ">" is expected. The first expected relation
# is "<"
flag = True
for i in range(n-1):
# "<" relation expected
if flag is True:
# If we have a situation like A > B > C,
# we get A > C < B
# by swapping B and C
if arr[i] > arr[i+1]:
arr[i], arr[i+1] = arr[i+1], arr[i]
# ">" relation expected
else:
# If we have a situation like A < B < C,
# we get A < C > B
# by swapping B and C
if arr[i] < arr[i+1]:
arr[i], arr[i+1] = arr[i+1], arr[i]
flag = bool(1 - flag)
print(arr)
# Driver program
arr = [4, 3, 7, 8, 6, 2, 1]
n = len(arr)
zigZag(arr, n)
# This code is contributed by Pratik Chhajer
# This code was improved by Hardik Jain
// C# program to sort an array in Zig-Zag form
using System;
class GFG {
static int[] arr = new int[] { 4, 3, 7, 8, 6, 2, 1 };
// Method for zig-zag conversion of array
static void zigZag()
{
// Flag true indicates relation "<"
// is expected, else ">" is expected.
// The first expected relation
// is "<"
bool flag = true;
int temp = 0;
for (int i = 0; i <= arr.Length - 2; i++) {
// "<" relation expected
if (flag) {
// If we have a situation like A > B > C,
// we get A > C < B by swapping B and C
if (arr[i] > arr[i + 1]) {
// Swap
temp = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = temp;
}
}
// ">" relation expected
else {
// If we have a situation like A < B < C,
// we get A < C > B by swapping B and C
if (arr[i] < arr[i + 1]) {
// Swap
temp = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = temp;
}
}
// Flip flag
flag = !flag;
}
}
// Driver code
public static void Main(String[] args)
{
zigZag();
foreach(int i in arr) Console.Write(i + " ");
}
}
// This code is contributed by amal kumar choubey
<script>
// JavaScript program to sort an array
// in Zig-Zag form
// Program for zig-zag conversion of array
function zigZag(arr, n)
{
// Flag true indicates relation "<"
// is expected, else ">" is expected.
// The first expected relation is "<"
let flag = true;
for(let i = 0; i <= n - 2; i++)
{
// "<" relation expected
if (flag)
{
// If we have a situation like A > B > C,
// we get A > C < B by swapping B and C
if (arr[i] > arr[i + 1])
temp = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = temp;
}
// ">" relation expected
else
{
// If we have a situation like A < B < C,
// we get A < C > B by swapping B and C
if (arr[i] < arr[i + 1])
temp = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = temp;
}
// Flip flag
flag = !flag;
}
}
// Driver code
let arr = [ 4, 3, 7, 8, 6, 2, 1 ];
let n = arr.length;
zigZag(arr, n);
for(let i = 0; i < n; i++)
document.write(arr[i] + " ");
// This code is contributed by Surbhi Tyagi.
</script>
Time complexity: O(N)
Auxiliary Space: O(1)
Illustration of the Expected Approach:
Convert array into Zig-Zag fashion | DSA Problem
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Here’s the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem