A key-address mapping sort algorithm

Authors:
Chenn-Jung Huang;Chih-Tai Guan;Yi-Ta Chuang
Affiliations:
Institute of Learning Technology, College of Science, National Hualien University of Education, Hualien, Taiwan;Institute of Learning Technology, College of Science, National Hualien University of Education, Hualien, Taiwan;Institute of Learning Technology, College of Science, National Hualien University of Education, Hualien, Taiwan
Venue:
ACOS'06 Proceedings of the 5th WSEAS international conference on Applied computer science
Year:
2006

Citing 12
Cited 0

A simple linear-time algorithm for in situ merging

Information Processing Letters
Practical in-place merging

Communications of the ACM
Analysis of a modified address calculation sorting algorithm

The Computer Journal
Introduction to algorithms

Introduction to algorithms
Sorting by Address Calculation

Journal of the ACM (JACM)
Stable Sorting in Asymptotically Optimal Time and Extra Space

Journal of the ACM (JACM)
Algorithm 245: Treesort

Communications of the ACM
Algorithm 23: MATH SORT

Communications of the ACM
A high-speed sorting procedure

Communications of the ACM
Algorithms and Data Structures: Design, Correctness, Analysis

Algorithms and Data Structures: Design, Correctness, Analysis
Lecture Notes on Bucket Algorithms

Lecture Notes on Bucket Algorithms
Bottom-Up-Heap Sort, a New Variant of Heap Sort Beating on Average Quick Sort (if n is not very small)

MFCS '90 Proceedings of the Mathematical Foundations of Computer Science 1990

Quantified Score

Hi-index	0.02

Visualization

Abstract

Various methods, such as address-calculation sort, distribution counting sort, radix sort, and bucket sort, adopt the values being sorted to improve sorting efficiency, but require extra storage space. This work presents a specific key-address mapping sort implementation. The proposed algorithm has the advantages of linear average-time performance and no requirement for linked-list data structures, and can avoid the tedious second round of sorting required by other content-based sorting algorithms, such as Groupsort. The key-address mapping function employed in the proposed algorithm can fit data in any specific distribution when the mapping function is carefully designed. The case for the uniformly distributed data is explored herein to demonstrate the effectiveness of the proposed key-address mapping functions. Although the computation of the average and the standard deviation increases the overhead in our sorting algorithm, the empirical results indicate that the proposed sorting algorithm is still faster than both Quicksort and Groupsort for lists comprising 1,000 to 1,600,000 positive integers.