Question

(a) Implement Counting Inversions algorithm in C++. Provide the complete program here which returns the count and the array.

(b) Test your code using this input: a = [2, 6, 1, 5, 4, 3] where array a is the list of your ranking for the given 6 songs.

Answer 1

`Hey,

Note: Brother if you have any queries related the answer please do comment. I would be very happy to resolve all your queries.

#include <iostream>
using namespace std;
  
int getInvCount(int arr[], 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;
}
  
// Driver Code
int main()
{
int arr[] = { 2, 6, 1, 5, 4, 3 };
int n = sizeof(arr) / sizeof(arr[0]);
cout << " Number of inversions are "
<< getInvCount(arr, n);
return 0;
}

Kindly revert for any queries

Thanks.