hacktoberfest_2022
hacktoberfest_2022 copied to clipboard
Adding a code of inversion count
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).
please follow the id and mssg here i will merge it after 2 days bcs more than 150 pr are pending