Linear Time Sorting of Skewed Distributions

This work presents an e cient linear average time algorithm to sort lists of integers that follow skewed distributions. It also studies a particular case where the list follows the Zipf's distribution, and presents a example application where the algorithm is used to reduce the time to build word-based Hu man codes.

• Type: Conference
• Year: 1999
• Where: SPIRE
• Authors: Edleno Silva de Moura, Gonzalo Navarro, Nivio Ziviani
• Keywords: Average Time Algorithm, Information Management, Skewed Distributions, SPIRE 1999, Word-based Hu Man