Count inversions in an array | Set 4 ( Using Trie )
Last Updated :
12 Jul, 2025
Inversion Count for an array indicates – how far (or close) the array is from being sorted. If the array is already sorted then inversion count is 0. If the array is sorted in reverse order that inversion count is the maximum.
Two elements a[i] and a[j] form an inversion if a[i] > a[j] and i < j.
For simplicity, we may assume that all elements are unique.
So, our task is to count the number of inversions in the array. That is the number of pair of elements (a[i], a[j]) such that:
Example:
Input: arr[] = {8, 4, 2, 1}
Output: 6
Given array has six inversions (8, 4), (4, 2),
(8, 2), (8, 1), (4, 1), (2, 1).
Input: arr[] = { 1, 20, 6, 4, 5 }
Output: 5
- Naive and Modified Merge Sort
- Using AVL Tree
- Using BIT
Approach:
We will iterate backwards in the array and store each element into the Trie. To store a number in Trie we
have to break the number into its binary form and If the bit is 0 then it signifies we store that bit into the left pointer of the current node and if it is 1 we will store it into the right pointer of the current node and correspondingly change the current node. We will also maintain the count which signifies how many numbers follow the same path till that node.
Structure of Node of the Trie
struct node{
int count;
node* left;
node* right;
};
At any point, while we are storing the bits, we happen to move to the right pointer (i.e the bit is 1) we will check if the left child exists then this means there are numbers which are smaller than the current number who are already been stored into the Trie, these numbers are only the inversion count so we will add these to the count.
Below is the implementation of the approach
C++
// C++ implementation
#include <iostream>
using namespace std;
// Structure of the node
struct Node {
int count;
Node* left;
Node* right;
};
// function to initialize
// new node
Node* makeNewNode()
{
Node* temp = new Node;
temp->count = 1;
temp->left = NULL;
temp->right = NULL;
return temp;
}
// Insert element in trie
void insertElement(int num,
Node* root,
int& ans)
{
// Converting the number
// into binary form
for (int i = 63; i >= 0; i--) {
// Checking if the i-th
// bit ios set or not
int a = (num & (1 << i));
// If the bit is 1
if (a != 0) {
// if the bit is 1 that means
// we have to go to the right
// but we also checks if left
// pointer exists i.e there is
// at least a number smaller than
// the current number already in
// the trie we add that count
// to ans
if (root->left != NULL)
ans += root->left->count;
// If right pointer is not NULL
// we just iterate to that
// position and increment the count
if (root->right != NULL) {
root = root->right;
root->count += 1;
}
// If right is NULL we add a new
// node over there and initialize
// the count with 1
else {
Node* temp = makeNewNode();
root->right = temp;
root = root->right;
}
}
// if the bit is 0
else {
// We have to iterate to left,
// we first check if left
// exists? if yes then change
// the root and the count
if (root->left != NULL) {
root = root->left;
root->count++;
}
// otherwise we create
// the left node
else {
Node* temp = makeNewNode();
root->left = temp;
root = root->left;
}
}
}
}
// function to count
// the inversions
int getInvCount(int arr[], int n)
{
Node* head = makeNewNode();
int ans = 0;
for (int i = n - 1; i >= 0; i--) {
// inserting each element in Trie
insertElement(arr[i],
head,
ans);
}
return ans;
}
// Driver Code
int main()
{
int arr[] = { 8, 4, 2, 1 };
int n = sizeof(arr) / sizeof(int);
cout << "Number of inversions are : "
<< getInvCount(arr, n);
return 0;
}
// Java implementation of above idea
import java.util.*;
class GFG
{
// Structure of the node
static class Node
{
int count;
Node left;
Node right;
};
static int ans;
// function to initialize
// new node
static Node makeNewNode()
{
Node temp = new Node();
temp.count = 1;
temp.left = null;
temp.right = null;
return temp;
}
// Insert element in trie
static void insertElement(int num,
Node root)
{
// Converting the number
// into binary form
for (int i = 63; i >= 0; i--)
{
// Checking if the i-th
// bit ios set or not
int a = (num & (1 << i));
// If the bit is 1
if (a != 0)
{
// if the bit is 1 that means
// we have to go to the right
// but we also checks if left
// pointer exists i.e there is
// at least a number smaller than
// the current number already in
// the trie we add that count
// to ans
if (root.left != null)
ans += root.left.count;
// If right pointer is not null
// we just iterate to that
// position and increment the count
if (root.right != null)
{
root = root.right;
root.count += 1;
}
// If right is null we add a new
// node over there and initialize
// the count with 1
else
{
Node temp = makeNewNode();
root.right = temp;
root = root.right;
}
}
// if the bit is 0
else
{
// We have to iterate to left,
// we first check if left
// exists? if yes then change
// the root and the count
if (root.left != null)
{
root = root.left;
root.count++;
}
// otherwise we create
// the left node
else
{
Node temp = makeNewNode();
root.left = temp;
root = root.left;
}
}
}
}
// function to count
// the inversions
static int getInvCount(int arr[], int n)
{
Node head = makeNewNode();
ans = 0;
for (int i = n - 1; i >= 0; i--)
{
// inserting each element in Trie
insertElement(arr[i],
head);
}
return ans;
}
// Driver Code
public static void main(String[] args)
{
int arr[] = { 8, 4, 2, 1 };
int n = arr.length;
System.out.print("Number of inversions are : "
+ getInvCount(arr, n));
}
}
// This code is contributed by 29AjayKumar
# Python3 implementation
# Structure of the node
class Node:
def __init__(self):
self.left = self.right = None
self.count = 1
# function to initialize
# new node
def makeNewNode():
temp = Node()
return temp
# Insert element in trie
def insertElement(num, root, ans):
# Converting the number
# into binary form
for i in range(63, -1, -1):
# Checking if the i-th
# bit ios set or not
a = (num & (1 << i));
# If the bit is 1
if (a != 0):
# if the bit is 1 that means
# we have to go to the right
# but we also checks if left
# pointer exists i.e there is
# at least a number smaller than
# the current number already in
# the trie we add that count
# to ans
if (root.left != None):
ans += root.left.count;
# If right pointer is not None
# we just iterate to that
# position and increment the count
if (root.right != None):
root = root.right;
root.count += 1;
# If right is None we add a new
# node over there and initialize
# the count with 1
else:
temp = makeNewNode();
root.right = temp;
root = root.right;
# if the bit is 0
else:
# We have to iterate to left,
# we first check if left
# exists? if yes then change
# the root and the count
if (root.left != None):
root = root.left;
root.count += 1
# otherwise we create
# the left node
else:
temp = makeNewNode();
root.left = temp;
root = root.left;
return ans
# function to count
# the inversions
def getInvCount(arr, n):
head = makeNewNode();
ans = 0;
for i in range(n - 1 ,-1, -1):
# inserting each element in Trie
ans = insertElement(arr[i], head, ans);
return ans;
# Driver Code
if __name__=='__main__':
arr = [ 8, 4, 2, 1 ]
n = len(arr)
print("Number of inversions are : " + str(getInvCount(arr, n)))
# This code is contributed by rutvik_56
// C# implementation of above idea
using System;
class GFG
{
// Structure of the node
public class Node
{
public int count;
public Node left;
public Node right;
};
static int ans;
// function to initialize
// new node
static Node makeNewNode()
{
Node temp = new Node();
temp.count = 1;
temp.left = null;
temp.right = null;
return temp;
}
// Insert element in trie
static void insertElement(int num,
Node root)
{
// Converting the number
// into binary form
for (int i = 63; i >= 0; i--)
{
// Checking if the i-th
// bit ios set or not
int a = (num & (1 << i));
// If the bit is 1
if (a != 0)
{
// if the bit is 1 that means
// we have to go to the right
// but we also checks if left
// pointer exists i.e there is
// at least a number smaller than
// the current number already in
// the trie we add that count
// to ans
if (root.left != null)
ans += root.left.count;
// If right pointer is not null
// we just iterate to that
// position and increment the count
if (root.right != null)
{
root = root.right;
root.count += 1;
}
// If right is null we add a new
// node over there and initialize
// the count with 1
else
{
Node temp = makeNewNode();
root.right = temp;
root = root.right;
}
}
// if the bit is 0
else
{
// We have to iterate to left,
// we first check if left
// exists? if yes then change
// the root and the count
if (root.left != null)
{
root = root.left;
root.count++;
}
// otherwise we create
// the left node
else
{
Node temp = makeNewNode();
root.left = temp;
root = root.left;
}
}
}
}
// function to count the inversions
static int getInvCount(int []arr, int n)
{
Node head = makeNewNode();
ans = 0;
for (int i = n - 1; i >= 0; i--)
{
// inserting each element in Trie
insertElement(arr[i], head);
}
return ans;
}
// Driver Code
public static void Main(String[] args)
{
int []arr = { 8, 4, 2, 1 };
int n = arr.Length;
Console.Write("Number of inversions are : " +
getInvCount(arr, n));
}
}
// This code is contributed by 29AjayKumar
<script>
// JavaScript implementation of above idea
// Structure of the node
class Node
{
constructor()
{
this.count = 0;
this.left = null;
this.right = null;
}
};
var ans = 0;
// function to initialize
// new node
function makeNewNode()
{
var temp = new Node();
temp.count = 1;
temp.left = null;
temp.right = null;
return temp;
}
// Insert element in trie
function insertElement(num, root)
{
// Converting the number
// into binary form
for (var i = 63; i >= 0; i--)
{
// Checking if the i-th
// bit ios set or not
var a = (num & (1 << i));
// If the bit is 1
if (a != 0)
{
// if the bit is 1 that means
// we have to go to the right
// but we also checks if left
// pointer exists i.e there is
// at least a number smaller than
// the current number already in
// the trie we add that count
// to ans
if (root.left != null)
ans += root.left.count;
// If right pointer is not null
// we just iterate to that
// position and increment the count
if (root.right != null)
{
root = root.right;
root.count += 1;
}
// If right is null we add a new
// node over there and initialize
// the count with 1
else
{
var temp = makeNewNode();
root.right = temp;
root = root.right;
}
}
// if the bit is 0
else
{
// We have to iterate to left,
// we first check if left
// exists? if yes then change
// the root and the count
if (root.left != null)
{
root = root.left;
root.count++;
}
// otherwise we create
// the left node
else
{
var temp = makeNewNode();
root.left = temp;
root = root.left;
}
}
}
}
// function to count the inversions
function getInvCount(arr, n)
{
var head = makeNewNode();
ans = 0;
for (var i = n - 1; i >= 0; i--)
{
// inserting each element in Trie
insertElement(arr[i], head);
}
return ans;
}
// Driver Code
var arr = [8, 4, 2, 1];
var n = arr.length;
document.write("Number of inversions are : " +
getInvCount(arr, n));
</script>
Output: Number of inversions are : 6
Time Complexity: O(Nlog(N))
Auxiliary Space: O(Nlog(N))
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