Counting Inversions Problem

akshitagit / CPP

Repository for C++/C codes and algos.

https://github.com/akshitagupta15june

MIT License

488 stars 433 forks source link

Counting Inversions Problem #229

Open AC-BOSS opened 3 years ago

AC-BOSS commented 3 years ago

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?

Roshan13046 commented 3 years ago

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