Count Inversion

[ishasharma7]

This problem shows how far (or close) the array is from being sorted. This will be implemented using Merge sort. The language used is C++.

[Taneesha-creates]

Hello @ishasharma7 , thank you for creating an issue, it has now been assigned to you.

Important:

Before you start your work on this issue, make sure you go through the README.md and Contribution Guidelines.md

File structure:

1. In the Sorting directory, and navigate to the sub-directory Merge Sort.
2. In the Algorithm.md, please add the problem statement.
3. Move to the C++ directory.
4. Create the file of your code in camel case.

Here's how the final structure should look like:

• Sorting
  • Merge Sort
    • Algorithm.md
    • C++
      • CountInversion.cpp

Please follow the same naming conventions as mentioned.

Before you create a pull request, make some changes in your forked repository so that it matches with the current one and there are no conflicts (git pull).

Note that all PRs are being checked for plagiarism, please refrain from indulging in any crooked means, we trust you!

We thank you for your contribution and time and we hope that you enjoy contributing to open source.