By Topic

Integer sorting in O(n√(log log n)) expected time and linear space

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Han, Y. ; Sch. of Interdisciplinary Comput. & Eng., Missouri Univ., Kansas City, MO, USA ; Thorup, M.

We present a randomized algorithm sorting n integers in O(n√(log log n)) expected time and linear space. This improves the previous O(n log log n) bound by Anderson et al. (1995). As an immediate consequence, if the integers are bounded by U, we can sort them in O(n√(log log U)) expected time. This is the first improvement over the O (n log log U) bound obtained with van Emde Boas' data structure. At the heart of our construction, is a technical deterministic lemma of independent interest; namely, that we split n integers into subsets of size at most √n in linear time and space. This also implies improved bounds for deterministic string sorting and integer sorting without multiplication.

Published in:

Foundations of Computer Science, 2002. Proceedings. The 43rd Annual IEEE Symposium on

Date of Conference: