Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Let A[1..n] be an array of n distinct numbers. If i A[j], then the pair (i, j) is called an inversion of A.

Let A[1..n] be an array of n distinct numbers. If i A[j], then the pair (i, j) is called an inversion of A.

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
Related questions
Question
100%

Use java coding lanuage to explain if needed thanks

Let A[1..n] be an array of n distinct numbers. If i <j and A[i] > A[j], then the pair (i, j) is called an inversion of A. This problem appears in the real-life scenario below. Music (or movie) sites try to match your song preferences with others: you rank n songs, music site consults database to find people with similar tastes. Similarity metric: number of inversions between two rankings. My rank: 1, 2, rank: a₁, a₂, ..., an; Songs i and j are inverted if i <j, but a¡ > aj. ***/ a. List the five inversions of the array (2, 3, 8, 6, 1) b. What array with elements from the set {1, 2, . n} has the most inversions? How many does it have? c. A Brute force solution to this problem is to check all (n²) pairs i and j. Give a divide-and-conquer algorithm that determines the number of inversions in any permutation on n elements in O(nlogn) worst-case time. (Hint: Modify MergeSort).
Transcribed Image Text:Let A[1..n] be an array of n distinct numbers. If i <j and A[i] > A[j], then the pair (i, j) is called an inversion of A. This problem appears in the real-life scenario below. Music (or movie) sites try to match your song preferences with others: you rank n songs, music site consults database to find people with similar tastes. Similarity metric: number of inversions between two rankings. My rank: 1, 2, rank: a₁, a₂, ..., an; Songs i and j are inverted if i <j, but a¡ > aj. ***/ a. List the five inversions of the array (2, 3, 8, 6, 1) b. What array with elements from the set {1, 2, . n} has the most inversions? How many does it have? c. A Brute force solution to this problem is to check all (n²) pairs i and j. Give a divide-and-conquer algorithm that determines the number of inversions in any permutation on n elements in O(nlogn) worst-case time. (Hint: Modify MergeSort).
Expert Solution
steps

Step by step

Solved in 4 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Randomized Select Algorithm
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS