Merge sort : counting inversion hackerrank solution // counting inversion using merge sort
In this video counting inversion using merge sort I have discussed what is merge sort and inversion is, how to approach the problem.
first we will learn basic merge sort and will point out where inversion occurs and in the second part I have written code for this problem.
Things which we need to keep in mind for merge sort.
1. divide the array
2.divide it recursively
3. merge array
4.count the inversion
if you are someone who is trying to solve all the problems from hackerrank interview preparation kit playlist and getting stuck anywhere or looking for optimized solution do check my playlist
• Hackerrank Interview Preparation Kit
Link for second part :
Watch video Merge sort : counting inversion hackerrank solution // counting inversion using merge sort online without registration, duration hours minute second in high quality. This video was added by user Kuldip Ghotane 04 August 2020, don't forget to share it with your friends and acquaintances, it has been viewed on our site 3,893 once and liked it 38 people.