search

SarthakKeshari / CPP-Questions-and-Solutions

This repository aims to solve and create new problems from different spheres of coding. A path to help students to get access to solutions and discuss their doubts.
MIT License
45 stars 132 forks source link

Count the number of inversion in the array. #319

Closed PrakharRathore123 closed 3 years ago

PrakharRathore123 commented 3 years ago

Enter your question -

The the number of inversion such that elements a[i] and a[j] form an inversion if a[i] > a[j] and i < j using merge sort.

Enter link to the question(if question belongs to any online platform) -

-

Tags for the question(eg - Array, Basic, Stack, etc.) -

Merge sort, Array , Recursion

PrakharRathore123 commented 3 years ago

@SarthakKeshari Kindly assign me this issue.

SarthakKeshari commented 3 years ago

@PrakharRathore123, This issue has already been addressed. Kindly go through the repo.