Inversion Count for an array indicates – how far (or close) the array is from being sorted. If array
is already sorted then inversion count is 0. If array is sorted in reverse order then inversion count
is the maximum. Formally speaking, two elements a[i] and a[j] form an inversion if a[i] > a[j]
and i < j. Example: The sequence 2, 4, 1, 3, 5 has three inversions (2, 1), (4, 1), (4, 3).
Project Description: Download the [login to view URL] file via the following URL.
URL:[login to view URL]
This file contains all of the 100,000 integers between 1 and 100,000 (inclusive) in some order,
with no integer repeated. Your task is to compute the number of inversions in the file given,
where the i-th row of the file indicates the i-th entry of an array. Because of the large size of this
array, you should implement a divide-and-conquer algorithm
I Have more than 10 year of experience in programming with c ,c++ , .net. I am a It Engineer and so i know a lot about divide n conquer algorithm . I can get this task completed easily. Thank you for the opportunity.
$12 USD en 2 días
0,0 (0 comentarios)
0,0
0,0
3 freelancers están ofertando un promedio de $26 USD por este trabajo
Hi
We have analyed your Inversion count problem and
Started to develop a solution to it
Approch used : Merge Algorithm
Update :
We have completed the solution to it
output : 2407905288
Hope to hear from you on chat we you have some other requirements
Here are some of the work done by us
https://www.freelancer.com/projects/Graphic-Design/Build-Website-9647448/
Thanks