Expected Linear Time Sorting for Word Size Ω(log2 n loglogn)


Sorting n integers in the word-RAM model is a fundamental problem and a long-standing open problem is whether integer sorting is possible in linear time when the word size is ω(logn). In this paper we give an algorithm for sorting integers in expected linear time when the word size is Ω(log n log logn). Previously expected linear time sorting was only… (More)
DOI: 10.1007/978-3-319-08404-6_3


2 Figures and Tables

Slides referencing similar topics