1. (50 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 divide-and-conquer techniqueto count the number of inversion in the array. 2. (50 points) Given two sets of nuniqueintegers A and B, determine if A is equal to B, i.e., all the elements of A are in B. Write a program that uses a transform-and-conqueralgorithm with efficiency class Θ(nlogn) to solve this problem. Example #1: Enter the number of integers in the sets: 4 Enter the first set: 9 5 3 2 Enter the second set: 3 2 9 5 These two sets are equal. Example #2: Enter the number of integers in the sets: 6 Enter the first set: 1 4 3 2 8 6 Enter the second set: 1 3 9 4 6 8 These two sets are not equal. Please note that a program using a brute-force algorithm with efficiency class Θ(n2) will NOT be marked.
The post 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]. appeared first on Homework Aider.
What Students Are Saying About Us
.......... Customer ID: 12*** | Rating: ⭐⭐⭐⭐⭐"Honestly, I was afraid to send my paper to you, but you proved you are a trustworthy service. My essay was done in less than a day, and I received a brilliant piece. I didn’t even believe it was my essay at first 🙂 Great job, thank you!"
.......... Customer ID: 11***| Rating: ⭐⭐⭐⭐⭐
"This company is the best there is. They saved me so many times, I cannot even keep count. Now I recommend it to all my friends, and none of them have complained about it. The writers here are excellent."
"Order a custom Paper on Similar Assignment at essayfount.com! No Plagiarism! Enjoy 20% Discount!"
