Given all these positive aspects of this algorithm, even though we can’t guarantee
that a prospective employee will get a job offer by describing the
MaxsubFastest algorithm when asked about the maximum subarray problem,
we can at least guarantee that this is the way to nail this question. Still, we are
nonetheless leaving one small detail as an exercise (C-1.1), which is to modify the
description of the MaxsubFastest algorithm so that, in addition to the value of the
maximum subarray summation, it also outputs the indices j and k that identify the
maximum subarray A[j : k].