sir my question as in inversion count we used merge sort how can we approach problems that we will know that in this kinda problem we can use merge sort ??? can i get resource for merge sort problems???
Sirmy doubt in is in merge sort
@tejasddongare inversion count can be done in other ways also . mergesort is one of the way and the tech is called divide and conqueror .
here refer this for merge sort problems -