Linear Time Sorting of Skewed Distributions

  • Authors:

  • Edleno Silva de Moura;Nivio Ziviani;Gonzalo Navarro z

  • Affiliations:

  • -;-;-

  • Venue:
  • SPIRE '99 Proceedings of the String Processing and Information Retrieval Symposium & International Workshop on Groupware
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

This work presents an efficient 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 Huffman codes.