Sorting Summary
lBucket sort / Radix
sort
lfastest asymptotic performance
lspecial assumptions about
data
lHeap sort
loptimal performance
lsorts arrays in-place
lMerge sort
loptimal performance
lsorts lists
lmore difficult for arrays
lMinsort, insertion
sort, bubble sort
leasy to code
lslow
lavoid for large data sets
lQuicksort
lfast on average
lslow worst case