Welcome to Live Chat

Welcome to LiveWebTutors Services, World's leading Academic solutions provider with Millions of Happy Students.

Call Back

24x7 Support Available

chat now

In A Hurry? Get A Callback

### shopping cart 0

Subject Solutions Code Description Price Delete

## 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 ndistinct integers. A pair (a[i], a[j]) is said to be an inversion if these numbers are out of order, i.e., i< jbut a[i] > a[j]. For example: if array acontains 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 nitems with weights w1...

View Complete Question >>

#### Question Preview:

1. (40 points) Let a[0..n-1] be an array of ndistinct integers. A pair (a[i], a[j]) is said to be an inversion if these numbers are out of order, i.e., i< jbut a[i] > a[j]. For example: if array acontains 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 nitems with weights w1, w2, ..., wnand values v1, v2, ..., vnand 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:

public class Inversion {

public static void main(String args[])

{

try

{

Get solution

#### \$20

Orginal Price : \$26.0

Pay Now

250 words

Don’t delay more, place your order now. Quick assignment help will be offered to you.

Order Now

## CUSTOMER REVIEWS

### Excellent

Based on 702 reviews See all reviews here

### One of the Best Service

I trust LiveWebTutors for my assignments because of their ability to deliver the perfect assignments time and again. Only a few of my assignments required minor revisions. The rest assured it is the best assignment writing service in the market.

Elizabeth
Sydney

### Great Service and on time

I felt so exhausted and burdened with the large number of assignments I had to write and desperately needed someone to help me with all the writing and there was LiveWebTutors company on the internet. They finished my assignments before the due date and also offered me a first-timer discount.

Christina
Perth

### One of the Best Assignment Provider

I ordered my Mathematics and Marketing assignments from them last month. I received the content on the set date. Most importantly, the assignments were well-written and plagiarism free. I scored a top grade for the assignment written by them. They are a reliable company.

Oli
Brisbane