Parallel algorithms for merging and sorting

Narsingh Deo, Dilip Sarkar

Research output: Contribution to journalArticlepeer-review

8 Scopus citations


We present an O(log(min(m,n,j))-time sequential algorithm to select the jth-smallest element of an array resulting from the merging of two sorted arrays A and B of sizes m and n. This algorithm is then used to design two parallel algorithms to partition A and B into p subarrays of size O( (m + n) p) in O( N p + log N) and O( N p + log p log N) times on crew pram and erew pram models with p processors, where N = m + n. A third parallel algorithm has been presented that partitions A and B in O( N p + log p log N) time into p pairs of subarrays of size O( N p) on erew pram with p processors without using any selection algorithm. Finally, these partitioning algorithms are used to obtain optimal parallel merging and sorting algorithms on crew prams and erew prams.

Original languageEnglish (US)
Pages (from-to)151-161
Number of pages11
JournalInformation Sciences
Issue number1-3
StatePublished - Aug 1991

ASJC Scopus subject areas

  • Software
  • Control and Systems Engineering
  • Theoretical Computer Science
  • Computer Science Applications
  • Information Systems and Management
  • Artificial Intelligence


Dive into the research topics of 'Parallel algorithms for merging and sorting'. Together they form a unique fingerprint.

Cite this