Fast in-place integer radix sorting

DOI10.1007/11428862_107MaRDI QIDQ5709609zbMATH OpenOpenAlexFDO

Authors Fouad El-Aker

Publication date 30 November 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b136575

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• MSL: An efficient adaptive in-place radix sort algorithm
• Radix Sorting with No Extra Space
• Power balance and apportionment algorithms for the United States Congress
• Sorting in linear time?
• scientific article; zbMATH DE number 1263219

Cited in

(12)

• An analysis and implementation of an efficient in-place bucket sort
• Radix sort trees in the large
• Fast stable in-place sorting with O(n) data moves
• Improved fast integer sorting in linear space
• A quicksort algorithm base on radix
• Radix Sorting with No Extra Space
• scientific article; zbMATH DE number 3915640 (Why is no real title available?)
• An Internal Hybrid Sort Algorithm Revisited
• Introspective sorting and selection revisited
• Power balance and apportionment algorithms for the United States Congress
• Adapting Radix Sort to the Memory Hierarchy
• MSL: An efficient adaptive in-place radix sort algorithm

This page was built for publication: Fast in-place integer radix sorting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5709609)