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: PEARSON
expand_more
expand_more
format_list_bulleted
Bartleby Related Questions Icon
Related questions
Question
THIS HAS TO BE IN A C++
THIS HAS TO BE IN A C++ PROGRAM NOT AN ALGORITHM. PLEASE WRITE THE PROGRAM IN C++. iM TRYING TO LEARN.
Transcribed Image Text:**Output Specification**
For each test case, print one line with a format of `The sequence has ? inversions` in the 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 the 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 the array is already sorted, then the inversion count is 0. If the array is sorted in reverse order, the 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 Θ(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 ``` 3 2 4 1 3 5 1 2 4 8 9 3 5 6 1 20 6 4 5 ```](https://content.bartleby.com/qna-images/question/07e3568b-ae89-410c-a106-09328ffd5134/cacfc99b-29e3-44bb-976c-273829a45610/tnefs6d_thumbnail.png){kind=link}
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 the array is already sorted, then the inversion count is 0. If the array is sorted in reverse order, the 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 Θ(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
```
3
2 4 1 3 5
1 2 4 8 9 3 5 6
1 20 6 4 5
```
Expert Solution
Check MarkThis question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
bartleby
This is a popular solution
bartleby
Trending nowThis is a popular solution!
bartleby
Step by stepSolved in 4 steps with 2 images
Knowledge Booster
Background pattern image
Similar questions
- Write a C++ program that prompts the user to enter five test scores (decimal) then:• Prints the average of the scores.• Converts the average to an integer value. (Use a constant to store the number of scores).arrow_forwardWrite a short program in C++ languge to compute the number of hours in a non-leap year. Compile and run, show me the source code and output screenarrow_forward
Recommended textbooks for you
- Text book imageComputer Networking: A Top-Down Approach (7th Edi...Computer EngineeringISBN:9780133594140Author:James Kurose, Keith RossPublisher:PEARSONText book imageComputer Organization and Design MIPS Edition, Fi...Computer EngineeringISBN:9780124077263Author:David A. Patterson, John L. HennessyPublisher:Elsevier ScienceText book imageNetwork+ Guide to Networks (MindTap Course List)Computer EngineeringISBN:9781337569330Author:Jill West, Tamara Dean, Jean AndrewsPublisher:Cengage Learning
- Text book imageConcepts of Database ManagementComputer EngineeringISBN:9781337093422Author:Joy L. Starks, Philip J. Pratt, Mary Z. LastPublisher:Cengage LearningText book imagePrelude to ProgrammingComputer EngineeringISBN:9780133750423Author:VENIT, StewartPublisher:Pearson EducationText book imageSc Business Data Communications and Networking, T...Computer EngineeringISBN:9781119368830Author:FITZGERALDPublisher:WILEY
Text book image
Computer Networking: A Top-Down Approach (7th Edi...
Computer Engineering
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:PEARSON
Text book image
Computer Organization and Design MIPS Edition, Fi...
Computer Engineering
ISBN:9780124077263
Author:David A. Patterson, John L. Hennessy
Publisher:Elsevier Science
Text book image
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:9781337569330
Author:Jill West, Tamara Dean, Jean Andrews
Publisher:Cengage Learning
Text book image
Concepts of Database Management
Computer Engineering
ISBN:9781337093422
Author:Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:Cengage Learning
Text book image
Prelude to Programming
Computer Engineering
ISBN:9780133750423
Author:VENIT, Stewart
Publisher:Pearson Education
Text book image
Sc Business Data Communications and Networking, T...
Computer Engineering
ISBN:9781119368830
Author:FITZGERALD
Publisher:WILEY