Question: CODE in C only. 1. Counting Inversions Question You are given a list of numbers A and asked to find out the number of inverted
CODE in C only.
1. Counting Inversions Question You are given a list of numbers A and asked to find out the number of inverted pairs in this list. A pair of numbers A[i],A[j] is said to be inverted if i A[j]. You are asked to solve this problem using Divide and Conquer Strategy, similar to what you have learned about mergesort. Input Format First line contains the number of test-cases T to solve. T test-cases follow. Each test-case starts with a line containing N the number of elements in the array A. The next line contains N space-separated integers, denoting the elements of the array, in order. Output Format One line for each test-case containing the number of inversions for the array in that test-case.
Step by Step Solution
3.33 Rating (150 Votes )
There are 3 Steps involved in it
include int getInvCount int arr int n int invcount 0 for int i 0 ... View full answer
Get step-by-step solutions from verified subject matter experts
