></a>
          </h5>
<div class="blockquote"><blockquote class="blockquote">
<p>
              Divide the data in parts, and each part is sorted by a thread. When
              the parts are sorted, they are merged to obtain the final results.
              These algorithms need additional memory for the merge, usually the
              same size as the data.
            </p>
<p>
              With a small number of threads, these algorithms have similar speed
              to the subdivision algorithms, b