In this talk, I shall explain Cole’s Parallel Merge Sorting Algorithm, which can sort lists of length n with O(n) processors in O(log n) time.