When sorting removes the need

• A

  Because a table indexed by a sum would use too much memory

• B

  Because a pair is not a subproblem of anything, so no recurrence can be written down

• C

  Because dynamic programming cannot be applied to sorted inputs

• D

  Because the sorted order tells you which way to move, so no search is needed