Please write an Inversion Counter Test Case with C++

Here is the TODO section

Here is the code before TODO, but I don't think you need them.

Fill in each section [slow and fast] with test cases to ensure your algorithms are working correctly. Be sure to cover corner cases, such as having only one value having no inversions having the worst case number of inversions and anything else you can think of You may repeat the same test for 'slow' and 'fast, so write your cases carefully and thoroughly. You must write 10 solid test cases for each section. If you have somehow installed cygwin 32-bit, which I think no one did, LONG MAX will cap out at INT_MAX, which is 2.1 billion. Some of my test cases go higher than that, so make sure you try things out in Linux Lab. Fill in each section [slow and fast] with test cases to ensure your algorithms are working correctly. Be sure to cover corner cases, such as having only one value having no inversions having the worst case number of inversions and anything else you can think of You may repeat the same test for 'slow' and 'fast, so write your cases carefully and thoroughly. You must write 10 solid test cases for each section. If you have somehow installed cygwin 32-bit, which I think no one did, LONG MAX will cap out at INT_MAX, which is 2.1 billion. Some of my test cases go higher than that, so make sure you try things out in Linux Lab