4. A sequence of n real numbers, where n is even, is given. Develop an algorithm to partition the sequence into n/2 pairs in the following way. We compute the sum of two numbers of each pair giving n/2 sums, and then find the maximum sum. The algorithm should minimize this maximum sum. What is the complexity of the algorithm?

2 1/2 inches

Explanation:

There are two marks on the line plot above 1 inch; both are on 1 1/4 inches.  This means to find the total length we add together

1 1/4 + 1 1/4

They already have a common denominator; this means we add the whole numbers then add the numerators.

1+1 = 2; 1/4 + 1/4 = 2/4

This gives us 2 2/4.  The fraction will simplify to 1/2; this gives us 2 1/2.