hacktoberfest_2022 icon indicating copy to clipboard operation
hacktoberfest_2022 copied to clipboard

Adding a code of inversion count

Open Aman1143 opened this issue 2 years ago • 1 comments

This is a c++ code for counting inversion for a given array. In this algorithm we are using merge sort .which time complexity is nlog(n). which is much better than o(n^2).

Aman1143 avatar Oct 01 '22 17:10 Aman1143

please follow the id and mssg here i will merge it after 2 days bcs more than 150 pr are pending

markandey007 avatar Oct 09 '22 08:10 markandey007