Sort Integers into a Linked List


  •  Yijie Han    
  •  Hemasree Koganti    
  •  Nikita Goyal    

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.



This work is licensed under a Creative Commons Attribution 4.0 License.
  • ISSN(Print): 1913-8989
  • ISSN(Online): 1913-8997
  • Started: 2008
  • Frequency: quarterly

Journal Metrics

Google-based Impact Factor (2019): 0.93

h-index (December 2019): 32

i10-index (December 2019): 127

h5-index (December 2019): N/A

h5-median(December 2019): N/A

( The data was calculated based on Google Scholar Citations. Click Here to Learn More. )

Contact