NAME

Sort::Radix - A multiple pass distribution sort algorithm

SYNOPSIS

  use Sort::Radix;
  
  @array = qw(flow loop pool Wolf root sort tour);
  radix_sort(\@array);
  print "@array\n";

DESCRIPTION

 This is an implementation based on Jarkko's Wolf boook (Mastering Algorithms with Perl, pp. 145-147)

 By definition: radix sort is a multiple pass distribution sort algorithm that distributes each item to a bucket according to part of
 the item's key beginning with the least significant part of the key. After each pass, items are collected from the buckets,
 keeping the items in order, then redistributed according to the next most significant part of the key. 

 Radix sort is nice as it take N * M passes, where N is the length of the keys. It is very useful for sorting large volumes of keys of
 the same length, such as postal codes.

SEE ALSO

Sort::Merge, Sort::Fields

IMPLEMENTOR

Edward Wijaya, <edward@localdomain>

AUTHOR

Jarkko Hietaniemi, <jhi@iki.fi<gt>

COPYRIGHT AND LICENSE

Copyright (C) 2005 by Edward Wijaya

This library is free software; you can redistribute it and/or modify it under the same terms as Perl itself, either Perl version 5.8.5 or, at your option, any later version of Perl 5 you may have available.