question on sorting algorithms

From: Alexander Korovyev (korovyev_at_rambler.ru)
Date: 11/29/03 

Date: 29 Nov 2003 08:47:57 -0800

Hello,

What sorting algorithms are there that are particularly well suited
for sequences with many repeating elements. For example consider a
sequence of one million numbers that has only 30 different numbers in
it. My favorite algorithm shows unacceptably poor performance in this
setting.

Thanks.

Alexander.

Relevant Pages

  • Re: question on sorting algorithms
    ... korovyev@rambler.ru (Alexander Korovyev) wrote: ... >What sorting algorithms are there that are particularly well suited ... >for sequences with many repeating elements. ...
    (comp.programming)
  • Re: question on sorting algorithms
    ... Joe \"Nuke Me Xemu\" Foster wrote: ... >> What sorting algorithms are there that are particularly well suited ... >> for sequences with many repeating elements. ...
    (comp.programming)
  • Re: question on sorting algorithms
    ... Alexander Korovyev wrote: ... > What sorting algorithms are there that are particularly well suited ... > for sequences with many repeating elements. ... but it seems like heap sort with an added ...
    (comp.programming)
  • Re: question on sorting algorithms
    ... > for sequences with many repeating elements. ... Never mind my caffeine-deficient ramblings about Quicksort in my ... of comparisons in the partitioning phase, ...
    (comp.programming)