Quick Sort for variable length strings

[SMcNeill]

Code: (Select All)

  Quick Sort time: .364000000001397
..      ...3w1C  ...E9kxK  ...F43q  ...Kds    ..0fw    ..0t8    ..16PR.m
..1ISn  ..1L2l

zzx7ajE  zzxNTbv  zzy1      zzy5      zzy7anq  zzyRJgl  zzyTO3    zzz
zzzuaby  zzzz7

  Comb Sort time: .8060000000041327

  QSort wins again!

Both are doing this million sort in less than a second, which I find more than sufficient for the vast majority of my needs.  Either is a good go-to for folks to just plug into their source.  QuickSort is generally faster, unless the data is already well sorted and CombSort triggers that swap=0 early exit after just a few quick passes.  I just personally find the comb sort to be less dangerous (no recursion or stack limits), and I've worked with it enough over the years that I can tweak it for any use case almost instantly.  

As always, folks just need to use whatever works best for them.  As long as *you're* happy with the compiled result, it's a good result.