Would a simple example of this be something like, > In a traditional "merge" algorithm, the second comparison depends on the output of the first, so it can't b

Would a simple example of this be something like, > In a traditional "merge" algorithm, the second comparison depends on the output of the first, so it can't be done at the same time. So it might make sense to merge "from the left" and merge "from the right" at the same time because those things can be done in parallel when both arrays have length > 1. ?