2. Using Python, implement the Divide-and-Conquer algorithm to count the number of inversions between two arrays....
2. Using Python, implement the Divide-and-Conquer algorithm to count the number of inversions between two arrays. The algorithm is based on Mergesort and counts the inversions while merging the sorted lists.
Homework Answers
In the merge function, if i is used to index left sub-array and j for right sub-array, at any step in merge(), if a[i] is greater than a[j], then there are (mid – i) inversions. This is because left and right sub-arrays are sorted, so all the remaining elements in left-sub-array will be greater than a[j]
Note:
Due to the unavailability of a desktop at the moment I had to write this code by hand, and not type it. However, this is a 100% working solution of inversion count written in python3 and I'm sure this will help you out. Thanks !
Add Answer to:
2. Using Python, implement the Divide-and-Conquer algorithm to
count the number of inversions between two arrays....
Q. Give a divide- and- conquer algorithm that computes the number of inversions in array A...
Q. Give a divide- and- conquer algorithm that computes the number of inversions in array A in O(n log n) time. Show that your algorithm takes O(n log n).
Algorithm Problem - Counting Number of Inversions
We are given a sequence ofndistinct numbers a1,...,an. We define an inversion to be a pair i<j such that ai>aj. Give an O(nlogn) algorithm to count the number of inversions. (Hint: assume that your algorithmreturns a sorted array of input sequences, as well as the number of inversions. Divide the input sequencesinto two halves, then count inversions and sort each half by doing recursive calls, and find a way to mergethese two sorted halves and to count the number of...
In this assignment you will implement merge-sort algorithm by creating 2 threads instead of 2 pro...
In this assignment you will implement merge-sort algorithm by creating 2 threads instead of 2 processes. First half of the array will be sorted by thread 1 and the second half by thread 2. When the threads complete their tasks, the main program will merge the half arrays. You should not waste your time on merge-sort algorithm. Use the merge sort algorithm given below void mergesort(int a[],int i,int j) { int mid; if(i<j) { mid=(i+j)/2; mergesort(a,i,mid); //left recursion mergesort(a,mid+1,j); //right...
(a) Implement Counting Inversions algorithm in C++. Provide the complete program here which returns the count...
(a) Implement Counting Inversions algorithm in C++. Provide the complete program here which returns the count and the array. (b) Test your code using this input: a = [2, 6, 1, 5, 4, 3] where array a is the list of your ranking for the given 6 songs.
Design a divide-and-conquer algorithm for computing the number of levels in a binary tree. In particular,...
Design a divide-and-conquer algorithm for computing the number of levels in a binary tree. In particular, the algorithm should return 0 and 1 for the empty and single-node trees respectively. Please provide the pseudocode for your algorithm. What is the running time of your algorithm in the worst case using O() notation? Design a divide-and-conquer algorithm for computing the number of levels in a COMPLETE binary tree. In particular, the algorithm should return 0 and 1 for the empty and...
8. (1) Implement the minimum subsequence sum using divide-and-conquer. (30 points) (2) For the array =[4-3...
8. (1) Implement the minimum subsequence sum using divide-and-conquer. (30 points) (2) For the array =[4-3 5-2-1 2 6-2, you should provide the solution using the minimum subsequence sum like the example in class. Test the sample for your code. (3) Obtain the T(n) expression for the above algorithm
ALGORITHM PROBLEM: A) Significant Inversions: We are given a sequence of n arbitrary but distinct real...
ALGORITHM PROBLEM: A) Significant Inversions: We are given a sequence of n arbitrary but distinct real numbers <a1 , a2 ,..., an>. We define a significant inversion to be a pair i < j such that ai > 2 aj . Design and analyze an O(n log n) time algorithm to count the number of significant inversions in the given sequence. [Hint: Use divide-&-conquer. Do the “combine” step carefully] B) The Maximum-Sum Monotone Sub-Array Problem: Input: An array A[1..n] of...
Divide and Conquer & Algorithm Design 5. (20 points) Consider the following algorithm Precondition: S is...
Divide and Conquer & Algorithm Design 5. (20 points) Consider the following algorithm Precondition: S is a sorted list index mystery (index low, index high, const Array S[], number x) if low S high then mid = (low + high) / 2 if x = Smid] then return mid elsif x < s[mid] then return mystery (low, mid-1, s, x) else return mystery (mid+1, high, s, x) else return 0 end What does the recursive algorithm above compute? Explain why?
I am working on the divide/conquer algorithm. I am having a trouble with a print for...
I am working on the divide/conquer algorithm. I am having a trouble with a print for output from reading the file. Here is my work. When you see I put the comment with TODO. that one I am struck with readfile. I wonder if you'd able to help me to fix the readfile to find a single number. Here is the input3.txt (1 12 13 24 35 46 57 58 69). after that, the output should be 0. int mergeInversion(int...
1. a. Using C++, represent the following graph using adjacency matrix, and implement depth first searching...
1. a. Using C++, represent the following graph using adjacency matrix, and implement depth first searching (DFS) by stack (define it with class) to traverse the graph. 6 7 2 4 b. If starting with node 2, when node 7 is printed, what numbers are in the stack (for DFS)? Please draw the stack step by step to show how the numbers are pushed into and popped out of it. 2. a. Given a set of integer numbers as int...
Design a divide-and-conquer algorithm for computing the number of levels in a binary tree. In particular, the algorithm should return 0 and 1 for the empty and single-node trees respectively. Please provide the pseudocode for your algorithm. What is the running time of your algorithm in the worst case using O() notation? Design a divide-and-conquer algorithm for computing the number of levels in a COMPLETE binary tree. In particular, the algorithm should return 0 and 1 for the empty and...
8. (1) Implement the minimum subsequence sum using divide-and-conquer. (30 points) (2) For the array =[4-3 5-2-1 2 6-2, you should provide the solution using the minimum subsequence sum like the example in class. Test the sample for your code. (3) Obtain the T(n) expression for the above algorithm
Divide and Conquer & Algorithm Design 5. (20 points) Consider the following algorithm Precondition: S is a sorted list index mystery (index low, index high, const Array S[], number x) if low S high then mid = (low + high) / 2 if x = Smid] then return mid elsif x < s[mid] then return mystery (low, mid-1, s, x) else return mystery (mid+1, high, s, x) else return 0 end What does the recursive algorithm above compute? Explain why?
1. a. Using C++, represent the following graph using adjacency matrix, and implement depth first searching (DFS) by stack (define it with class) to traverse the graph. 6 7 2 4 b. If starting with node 2, when node 7 is printed, what numbers are in the stack (for DFS)? Please draw the stack step by step to show how the numbers are pushed into and popped out of it. 2. a. Given a set of integer numbers as int...
Most questions answered within 3 hours.
-
In response to concerns about nutritional contents of fast
foods, McDonald's has announced that it will...
asked 8 minutes ago -
A gun with inertia 5.5 kg fires a 13-g bullet at a stationary
target located 1.0...
asked 9 minutes ago -
A box contains twenty-five screws which are identical in size,
but 13 of which are copper...
asked 12 minutes ago -
“Is it possible that objectively
a product is high quality but subjectively low
quality?”
Please support...
asked 14 minutes ago -
OCHEM LAB
Why does hydration of 2-methyl-3-butyn-2-ol give the ketone,
3-hydroxy-3-methyl-2-butanone (4), rather than the aldehyde,...
asked 23 minutes ago -
A sample of gas at 15 ⁰C and 0.988 atm has a volume of 2.58
liters....
asked 30 minutes ago -
Enzymes are required in retroviruses because the genome
is not used directly as mRNA (T/F)
Please...
asked 29 minutes ago -
An AC generator supplies an rms voltage of 240 V at 50.0 Hz. It
is connected...
asked 41 minutes ago -
Raising taxes on wealthy Americans won’t be enough to deal with the
nation’s budget deficit. Some...
asked 25 minutes ago -
A bacterium (mass = 2.27 x 10−15 kg) in the blood is moving at
0.306 m/s....
asked 28 minutes ago -
look at the Fourth Lateran Council's Canon 18, and argue why a
defendant should not be...
asked 28 minutes ago -
An electron moves at 2.60×106 m/s through a region in
which there is a magnetic field...
asked 40 minutes ago