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
Hi, I have read the requirements and I would like to do this project if given the opportunity. I am a computer science practitioner and having the "Java and Algorithms Certification Badge" in my profile gives me confidence and assurance that I can deliver you the project as required. Let me know if you are interested so I can start. Thanks.
message me before awarding this project to me
message me before awarding this project to me
message me before awarding this project to me
message me before awarding this project to me
message me before awarding this project to me
message me before awarding this project to me
message me before awarding this project to me
Greetings, I've authored books on Java, C++ and Data Structures, and have over 10 years of professional experience as a software engineer and consultant. I am an Excel expert and provide training on business solution development using Excel with VBA. As I'm doing a lot of web development using PHP, I believe I can finish the project within a day.
hello there..
if you give us scope we have creative designers and developers who will complete your projects ASAP..
So please come in chat i will contact with you to direct my developer, that will be batter for us so let's come in chat and let's talk about your projects..
Hello, How are you doing? I can do this task, I have experience in mathematical operation, . I can develop this application in cs# . and my code will be heavily commented so you can understand it better. I know how to do this. I hope to hear from you Soon. we can start right away, Thanks
Result: 2379437330
Job done in: 0.61474514007568 seconds (at i7 2600)
:)
I found the implementation (in PHP) of the algorithm in the network (public WWW)
I changed only one line because it incorrectly calculate (for small set of numbers)
+ "timer execution"