ordenacao -r -s7654321 (10 sequencias aleatorias)

    n      shell  merge_r  merge_i     heap quickCLR
    256     0.00     0.00     0.00     0.00     0.00 
    512     0.00     0.00     0.00     0.00     0.00 
   1024     0.00     0.00     0.00     0.00     0.00 
   2048     0.00     0.00     0.00     0.00     0.00 
   4096     0.01     0.01     0.01     0.01     0.00 
   8192     0.01     0.01     0.01     0.00     0.01 
  16384     0.03     0.02     0.02     0.02     0.02 
  32768     0.07     0.05     0.05     0.05     0.04 
  65536     0.16     0.11     0.11     0.10     0.08 
 131072     0.40     0.25     0.30     0.23     0.17 
 262144     0.92     0.53     0.66     0.55     0.37 
 524288     2.17     1.17     1.41     1.31     0.78 
1048576     4.96     2.45     2.95     3.05     1.66 


Legenda:
shell    = shellsort original (Knuth)
merge_r  = mergesort recursivo (top-down)
merge_i  = mergesort iterativo (bottom-up)
heap     = heapsort
quickCLR = quicksort do livro do Cormen, Leiserson e Rivest

compilador: gcc -O2 
computador: Pentium II, 233Mhz, 128Mbytes