Sort Integers into a Linked List

Yijie Han, Hemasree Koganti and Nikita Goyal

Computer and Information Science, 2020, vol. 13, issue 1, 51

Abstract: We show that n integers in {0, 1, …, m-1} can be sorted into a linked list in constant time using nlogm processors on the Priority CRCW PRAM model, and they can be sorted into a linked list in O(loglogm/logt) time using nt processors on the Priority CRCW PRAM model.

Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.ccsenet.org/journal/index.php/cis/article/download/0/0/41815/43444 (application/pdf)
http://www.ccsenet.org/journal/index.php/cis/article/view/0/41815 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ibn:cisjnl:v:13:y:2020:i:1:p:51

Access Statistics for this article

More articles in Computer and Information Science from Canadian Center of Science and Education Contact information at EDIRC.
Bibliographic data for series maintained by Canadian Center of Science and Education ().