CPP icon indicating copy to clipboard operation
CPP copied to clipboard

Published 20 hours ago • verified publisher icon akshitagit

Counting Inversions Problem

Open AC-BOSS opened this issue 4 years ago • 1 comments

Description

Given an array A, count the total number of possible inversions. If there indices i and j such that i > j and A[i] < A[j], then there is a possible inversion. May I add the solution to this problem, using Divide and Conquer method? Should I create a new folder named Divide and Conquer? Or should I add this code to Array folder?

AC-BOSS avatar Sep 30 '20 12:09 AC-BOSS

I would like to work on this issue. Please assign.

Roshan13046 avatar Sep 30 '20 22:09 Roshan13046