count inv

Author: sachuverma

DSA Crack Sheet/README.md

@@ -16,6 +16,7 @@
 - [Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number/ "view questions") - [Cpp Solution](./solutions/Find%20the%20Duplicate%20Number.cpp)
 - [Merge Intervals](https://leetcode.com/problems/merge-intervals/ "view questions") - [Cpp Solution](./solutions/Merge%20Intervals.cpp)
 - [Next Permutation](https://leetcode.com/problems/next-permutation/ "view questions") - [Cpp Solution](./solutions/Next%20Permutation.cpp)
+- [Count Inversions](https://practice.geeksforgeeks.org/problems/inversion-of-array-1587115620/1# "view questions") - [Cpp Solution](./solutions/Count%20Inversions.cpp)
 - []( "view questions") - [Cpp Solution](./solutions/.cpp)
 
 <!-- - []( "view questions") - [Cpp Solution](./solutions/) -->

DSA Crack Sheet/solutions/Count Inversions.cpp

@@ -0,0 +1,89 @@
+/*
+Count Inversions
+================
+
+Given an array of integers. Find the Inversion Count in the array. 
+
+Inversion Count: For an array, inversion count indicates how far (or close) the array is from being sorted. If array is already sorted then the inversion count is 0. If an array is sorted in the reverse order then the inversion count is the maximum. 
+Formally, two elements a[i] and a[j] form an inversion if a[i] > a[j] and i < j.
+
+Example 1:
+Input: N = 5, arr[] = {2, 4, 1, 3, 5}
+Output: 3
+Explanation: The sequence 2, 4, 1, 3, 5 
+has three inversions (2, 1), (4, 1), (4, 3).
+
+Example 2:
+Input: N = 5
+arr[] = {2, 3, 4, 5, 6}
+Output: 0
+Explanation: As the sequence is already 
+sorted so there is no inversion count.
+
+Example 3:
+Input: N = 3, arr[] = {10, 10, 10}
+Output: 0
+Explanation: As all the elements of array 
+are same, so there is no inversion count.
+
+Your Task:
+You don't need to read input or print anything. Your task is to complete the function inversionCount() which takes the array arr[] and the size of the array as inputs and returns the inversion count of the given array.
+
+Expected Time Complexity: O(nLogn).
+Expected Auxiliary Space: O(n).
+
+Constraints:
+1 ≤ N ≤ 5*105
+1 ≤ C ≤ 1018
+*/
+
+long long merge(long long arr[], long long temp[], int left, int mid, int right)
+{
+  int i, j, k;
+  long long inv_count = 0;
+
+  i = left, j = mid, k = left;
+  while ((i <= mid - 1) && (j <= right))
+  {
+    if (arr[i] <= arr[j])
+      temp[k++] = arr[i++];
+    else
+    {
+      temp[k++] = arr[j++];
+      inv_count = inv_count + (mid - i);
+    }
+  }
+
+  while (i <= mid - 1)
+    temp[k++] = arr[i++];
+  while (j <= right)
+    temp[k++] = arr[j++];
+
+  for (i = left; i <= right; i++)
+    arr[i] = temp[i];
+  return inv_count;
+}
+
+long long _mergeSort(long long arr[], long long temp[], int left, int right)
+{
+  long long mid, inv_count = 0;
+  if (right > left)
+  {
+    mid = (right + left) / 2;
+
+    inv_count += _mergeSort(arr, temp, left, mid);
+    inv_count += _mergeSort(arr, temp, mid + 1, right);
+    inv_count += merge(arr, temp, left, mid + 1, right);
+  }
+  return inv_count;
+}
+
+// Function to find inversion count in the array
+// arr[]: Input Array
+// N : Size of the Array arr[]
+
+long long int inversionCount(long long arr[], long long N)
+{
+  long long temp[N];
+  return _mergeSort(arr, temp, 0, N - 1);
+}