Breaking News: Grepper is joining You.com. Read the official announcement!

count inversion

Depressed Dugong answered on September 24, 2023 Popularity 9/10 Helpfulness 1/10

answer count inversion

count inversion

Comment

int i =0,j=0,k=0;
    int count =0;
    while(i<A.size() && B.size())
    {
        if(A[i] < B[j])
        {
            C[k++] = B[j++];
        }
        else
        {
            count += A.size()-i;
            C[k++] = A[i++];
        }
    }
    while(i<A.size()){
        C[k++] = A[i++];
    }
    while(j<B.size())
    {
        C[k++] = B[j++];
    }

Popularity 9/10 Helpfulness 1/10 Language cpp

Source: Grepper

Tags: c++ count inversion

Link to this answer
Share Copy Link

Contributed on Sep 24 2023

Depressed Dugong

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

count inversion

Contents

More Related Answers

count inversion

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.