期刊名称：International Journal of Computer and Information Technology
印刷版ISSN：2279-0764
出版年度：2021
卷号：10
期号：2
页码：1-4
语种：English
出版社：International Journal of Computer and Information Technology
摘要：We study linked list sorting and merging on the PRAM model. In this paper we show that n real numbers can be sorted into a linked list in constant time with n2+e processors or in ) time with n2 processors. We also show that two sorted linked lists of n integers in {0, 1, …, m} can be merged into one sorted linked list in O(log(c)n(loglogm)1/2) time using n/(log(c)n(loglogm)1/2) processors, where c is an arbitrarily large constant.
