Question: Hello, C++ My problem is that I have 5 sources that are [10000][1] each column in the sources is a page # and a specific
Hello,
C++
My problem is that I have 5 sources that are [10000][1]
each column in the sources is a page # and a specific integer 1-10000 randomly scattered
source1
| 1234 |
| 4323 |
source2
| 124 |
| 2313 |
source3
| 3213 |
| 4122 |
source4
| 569 |
| 1790 |
source5
| 783 |
| 609 |
I took the sum of each column between all five sources into a sumArray[10000][2]
the second column is the specific page.
sumArray
| 5923 | 1 |
| 13157 | 2 |
I need help creating a bubblesort algorithm to sort the sumArray in ascending order
additionally I need to sort each source how the sumArray is my in the second column by page number
finally I need to find the number of inversion in each of the five sources. When they're bubblesorted after being sorted how to sumArray is
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
