Editing Merge sort (section)

==== Pseudocode ====
Below, the complete pseudocode of the parallel multiway merge sort algorithm is given. We assume that there is a barrier synchronization before and after the multisequence selection such that every processor can determine the splitting elements and the sequence partition properly.
 /**
  * d: Unsorted Array of Elements
  * n: Number of Elements
  * p: Number of Processors
  * return Sorted Array
  */
 '''algorithm''' parallelMultiwayMergesort(d : Array, n : int, p : int) '''is'''
     o := '''new''' Array[0, n]                         // the output array
     '''for''' i = 1 '''to''' p '''do in parallel'''                // each processor in parallel
 <nowiki>        S_i := d[(i-1) * n/p, i * n/p] 	         // Sequence of length n/p</nowiki>
 	sort(S_i)                                // sort locally
         '''synch'''
 	v_i := msSelect([S_1,...,S_p], i * n/p)          // element with global rank i * n/p
         '''synch'''
 	(S_i,1, ..., S_i,p) := sequence_partitioning(si, v_1, ..., v_p) // split s_i into subsequences
 	    
 	o[(i-1) * n/p, i * n/p] := kWayMerge(s_1,i, ..., s_p,i)  // merge and assign to output array
 	
     '''return''' o