Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Problem Description Inversion Count for an array indicates - how far (or close) the array is from being sorted. If aray is already sorted then inversion count is 0. If array is sorted in reverse order that inversion count is the maximum. Formally speaking, two elements a[i] and a[j] form an inversion if a[i] > a[j] and i < j. Example: The sequence 2, 4, 1, 3, 5 has three inversions (2, 1), (4, 1), (4, 3). Requirement • Design should be based on divide and conquer. • Running time should NOT be worse than O(n log n). • Must use recursion to solve the subproblems. Input Specification Your program should read from an input file, which starts with a line indicating the number of test cases. Each of the following lines indicates a test case, and each test case includes a sequence of numbers (separated by spaces) for which you need to count inversions. Sample Input 2 4 1 3 5 1 2 4 8 9 3 5 6 1 20 6 4 5

Problem Description Inversion Count for an array indicates - how far (or close) the array is from being sorted. If aray is already sorted then inversion count is 0. If array is sorted in reverse order that inversion count is the maximum. Formally speaking, two elements a[i] and a[j] form an inversion if a[i] > a[j] and i < j. Example: The sequence 2, 4, 1, 3, 5 has three inversions (2, 1), (4, 1), (4, 3). Requirement • Design should be based on divide and conquer. • Running time should NOT be worse than O(n log n). • Must use recursion to solve the subproblems. Input Specification Your program should read from an input file, which starts with a line indicating the number of test cases. Each of the following lines indicates a test case, and each test case includes a sequence of numbers (separated by spaces) for which you need to count inversions. Sample Input 2 4 1 3 5 1 2 4 8 9 3 5 6 1 20 6 4 5

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question

THIS HAS TO BE IN A C++ PROGRAM NOT AN ALGORITHM. PLEASE WRITE THE PROGRAM IN C++. iM TRYING TO LEARN. 

 

THIS HAS TO BE IN A C++ PROGRAM NOT AN ALGORITHM. PLEASE WRITE THE PROGRAM IN C++. iM TRYING TO LEARN. 

Output Specification For each test case, print one line with a format of The sequence has ? inversions in console. Sample Output Below is the correct output for the previous sample input. The sequence has 3 inversions. The sequence has 7 inversions. The sequence has 5 inversions. Hint • The design can be based on merge sort. • How to get number of inversions in merge()?
Transcribed Image Text:Output Specification For each test case, print one line with a format of The sequence has ? inversions in console. Sample Output Below is the correct output for the previous sample input. The sequence has 3 inversions. The sequence has 7 inversions. The sequence has 5 inversions. Hint • The design can be based on merge sort. • How to get number of inversions in merge()?
Project: Count Inversions Problem Description Inversion Count for an array indicates - how far (or close) the array is from being sorted. If array is already sorted then inversion count is 0. If array is sorted in reverse order that inversion count is the maximum. Formally speaking, two elements a[i] and a[j] form an inversion if a[i] > a[j] and i «j. Example: The sequence 2, 4, 1, 3, 5 has three inversions (2, 1), (4, 1), (4, 3). Requirement • Design should be based on divide and conquer. • Running time should NOT be worse than O(n logn). • Must use recursion to solve the subproblems. Input Specification Your program should read from an input file, which starts with a line indicating the number of test cases. Each of the following lines indicates a test case, and each test case includes a sequence of numbers (separated by spaces) for which you need to count inversions. Sample Input 3 2 4 1 3 5 1 2 4 8 9 3 5 6 1 20 6 4 5
Transcribed Image Text:Project: Count Inversions Problem Description Inversion Count for an array indicates - how far (or close) the array is from being sorted. If array is already sorted then inversion count is 0. If array is sorted in reverse order that inversion count is the maximum. Formally speaking, two elements a[i] and a[j] form an inversion if a[i] > a[j] and i «j. Example: The sequence 2, 4, 1, 3, 5 has three inversions (2, 1), (4, 1), (4, 3). Requirement • Design should be based on divide and conquer. • Running time should NOT be worse than O(n logn). • Must use recursion to solve the subproblems. Input Specification Your program should read from an input file, which starts with a line indicating the number of test cases. Each of the following lines indicates a test case, and each test case includes a sequence of numbers (separated by spaces) for which you need to count inversions. Sample Input 3 2 4 1 3 5 1 2 4 8 9 3 5 6 1 20 6 4 5
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS