C++

One can earn a Canoe Skill Certificate by training and passing a Canoe Skills test offered by the local Water Safety Management. There are some individuals that need more training than others due to passing experiences, physical ability etc. The powers to be are considering matching a well to do individual with a not so well to do individual to increase the success rate and reduce training frustrations. Every individual has been ranked with a priority, prior to training, and each individual has a unique ranking. Your assignment is to match the most well to do individual with the least well to do individual with the remaining individuals in the list. The most well-to-do is matched with the least well-to-do, the second most well-to-do is matched with the second least well-to-do and so forth.

Your input file is CanoePriorities.txt

Output: List 6 pairs of matches across the page.

See example below.

Input: 1 3 8 2 7 5 6 4

Output: 1 8; 2 7; 3 6; 4 5

Restrictions; You will need to use an array to read in the initial input, sort the data and then match individuals. You are to use pointers only in your program, (ie no [ ]s are to be found in your code except for the array declaration). There are less than 60 folks signed for this this class offering