Close Button
Signup/Login
Back All services Close Button

World's Leading Assignment Library

Continued assistance through writing and revision till final submission by the professional and experienced writers.

  • 10 subjects

  • 2,10,1000
    solved Questions

  • 500 Solved Questions
    Added Everyday

  • Download Solution
    in Seconds

Write a program that uses the brute-force approach to count the number of inversions in the array.

Question Preview:

If there are 3 items with the following weights and values:
                  weight: 8 4 5
                  value:  20 10 11
and the capacity of the knapsack is 9, your program should then calculate the total weight and the
total value of each subset in the power set:
                 ...

View complete question »

Question Preview:

If there are 3 items with the following weights and values:
                  weight: 8 4 5
                  value:  20 10 11
and the capacity of the knapsack is 9, your program should then calculate the total weight and the
total value of each subset in the power set:
                  total weight of subset: 0, 8, 4, 12, 5, 13, 9, 17
                  total value of subset:  0, 20, 10, 30, 11, 31, 21, 41
The largest value that fits into the knapsack: 21.

View less »

Solution preview

Let a[0..n-1] be an array of n distinct integers. A pair (a[i], a[j]) is said to
be an inversion if these numbers are out of order, i.e., i < j but a[i] > a[j].
For example: if array a contains the following numbers:
                     9, 8, 4, 5
then the number of inversions is 5. 
(inversions are 9 > 8, 9 > 4, 9 > 5, 8 > 4, 8 > 5)
Write a program that uses the brute-force approach to count the number of inversions
in the array.

Get solution

java assignment help

© Livewebtutors. All Rights Reserved 2018

Livewebtutors
Rated 4.9/5 based on 2480 reviews
Arrow up