Call Back

24x7 Support Available

To Get the Best Price Chat With Our Experts

chat now

In A Hurry? Get A Callback

Signup/Login
Back All services
• Assignment Help
• Back All services
• Assignment Services
• Engineering
• Mechanical
• Basic Subjects
• Law
• Management
• Accounting and Finance
• Programming
• Medical
• Humanities
• Homework
• Back All services
• Homework help
• Writing Services
• Back All services
• Writing Services help
• Dissertation
• Back All services
• Dissertation help
• Universities
• Back All services
• Assignment by Universities
• city
• Back All services
• Assignment by City
• country
• Back All services
• Assignment by Country

# 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

### 1. (40 points) 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

Question Preview:

1. (40 points) 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:
&nbs...

View complete question »

Question Preview:

1. (40 points) 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.

2. (60 points) Write a program that uses the brute-force approach to solve the 0/1 knapsack problem. Suppose there are n items with weights w1, w2, ..., wn and values v1, v2, ..., vn and a knapsack of capacity W. Use the decrease-by-one technique to generate the power set and calculate the total weights and values of each subset, then find the largest value that fits into the knapsack and output that value.

For example: 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

Program:

import java.io.BufferedReader;

import java.io.InputStreamReader;

public class Inversion {

public static void main(String args[])

{

try

{

// buffered reader object to read the user input

Get solution

WhatsApp Order WhatsApp Order

#### STAY UPDATED WITH LIVEWEBTUTORS

we provide

free turnitin report get free turnitin
Free turnitin

© Livewebtutors. All Rights Reserved 2019