{"id":25835,"date":"2017-05-30T20:41:14","date_gmt":"2017-05-30T15:11:14","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=25835"},"modified":"2018-10-29T11:40:10","modified_gmt":"2018-10-29T06:10:10","slug":"java-programming-count-inversions-in-an-array","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/java-programming-count-inversions-in-an-array\/","title":{"rendered":"Count Inversions in an array"},"content":{"rendered":"

Count Inversions<\/strong> in an array <\/a>indicates – how far (or close) the array is from being sorted. If array is already sorted<\/a> then inversion count is 0. If array is sorted in reverse order that inversion count is the maximum.<\/p>\n

<\/span>Formally speaking, two elements a[i] and a[j] form an inversion if a[i] > a[j] and i < j<\/p>\n

Example:<\/strong><\/span><\/h4>\n

The sequence 2, 4, 1, 3, 5 has three inversions (2, 1), (4, 1), (4, 3)<\/p>\n

METHOD 1 (Simple)<\/strong><\/span><\/h3>\n

For each element, count number of elements which are on right side of it and are smaller than it.<\/p>\n[ad type=”banner”]\n

Implementation:<\/strong><\/span><\/h3>\n

Java Programming for Count Inversions in an array:\u00a0<\/b><\/span><\/h3>\n
<\/div> 
class Test{    static int arr[] = new int[]{1, 20, 6, 4, 5};         static int getInvCount(int n)    {      int inv_count = 0;      for (int i = 0; i < n - 1; i++)        for (int j = i+1; j < n; j++)          if (arr[i] > arr[j])            inv_count++;            return inv_count;    }      public static void main(String[] args)     {        System.out.println("Number of inversions are " + getInvCount(arr.length));         }}<\/code><\/pre> <\/div>\n
\n
Output:<\/strong><\/span><\/h3>\n
Number of inversions are 5<\/pre>\n
Time Complexity:<\/strong><\/span> O(n^2)<\/strong><\/p>\n
METHOD 2(Enhance Merge Sort)<\/strong><\/span><\/h3>\n
Suppose we know the number of inversions in the left half and right half of the array (let be inv1 and inv2<\/strong><\/em>), what kinds of inversions are not accounted for in Inv1 + Inv2? The answer is \u2013 the inversions we have to count during the merge step. Therefore, to get number of inversions, we need to add number of inversions in left subarray, right subarray and merge( )<\/a>.<\/p>\n
\"Count<\/p>\n
How to get number of inversions in merge()?<\/strong><\/span><\/h3>\n[ad type=”banner”]\n
In merge<\/a> process, let i is used for indexing left sub-array<\/a> and j for right sub-array. At any step in merge(), if a[i] is greater than a[j], then there are (mid \u2013 i) inversions. because left and right subarrays are sorted, so all the remaining elements in left-subarray (a[i+1], a[i+2] \u2026 a[mid]) will be greater than a[j]\n
\"Count<\/p>\n
The complete picture:<\/strong><\/span><\/h3>\n
\"Count<\/p>\n
Implementation:<\/strong><\/span><\/h3>\n
Java Programming for Count Inversions in an array:\u00a0<\/b><\/span><\/h3>\n[ad type=”banner”]\n
 
 <\/div> 
 \/\/ Java implementation of counting the \/\/ inversion using merge sort class Test{           static int mergeSort(int arr[], int array_size)    {        int temp[] = new int[array_size];        return _mergeSort(arr, temp, 0, array_size - 1);    }             static int _mergeSort(int arr[], int temp[], int left, int right)    {      int 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;    }              static int merge(int arr[], int temp[], int left, int mid, int right)    {      int i, j, k;      int 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;    }      public static void main(String[] args)     {        int arr[] = new int[]{1, 20, 6, 4, 5};        System.out.println("Number of inversions are " + mergeSort(arr, 5));         }}<\/code><\/pre> <\/div>\n
Output:<\/strong><\/span><\/h3>\n
Number of inversions are 5<\/pre>\n
If we want to count only inversions then we need to create a copy of original array and call mergeSort()<\/strong> on copy.
\n
\nTime Complexity:<\/span> O(nlogn)<\/strong><\/p>\n
Algorithmic Paradigm:\u00a0<\/strong><\/span>Divide and Conquer<\/strong><\/a><\/span><\/p>\n<\/div>\n","protected":false},"excerpt":{"rendered":"
Java Programming-Count Inversions in an array-Divide and Conquer-Inversion Count for an array indicates how far (or close) the array is from being sorted.<\/p>\n","protected":false},"author":1,"featured_media":26089,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[73719],"tags":[75860,75867,75866,75865,75859,75864,75876,75861,75863,75862,75877],"class_list":["post-25835","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-divide-and-conquer","tag-count-inversions-in-an-array-java","tag-count-inversions-in-matrix","tag-count-inversions-python","tag-counting-inversions-c","tag-counting-inversions-divide-and-conquer","tag-counting-inversions-divide-and-conquer-algorithm","tag-counting-inversions-python","tag-inversion-count-using-bit","tag-maximum-number-of-inversions-in-an-array","tag-write-a-c-program-to-find-the-inversion-count-of-an-array","tag-write-a-program-to-find-the-inversion-count-of-an-array-in-c"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/25835","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/comments?post=25835"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/25835\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media\/26089"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=25835"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=25835"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=25835"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}