Our amounts of data are growing rapidly, but we need to keep them in order. Resultingly one frequent issue is sorting this data. There are many sorting algorithms out there, which differ in their functionallity, stability, performance and space complexity. In this paper you will get to know three methods named Shell-, Merge- and Quicksort. Their special characteristics are explained and which to use when.
average user rating4.0 out of 5.0 based on 4reviews
This publication ist of type "preprint". To see comments and reviews from other users, you have to create your own comment or review for this post first.
Please log in to take part in the discussion (add own reviews or comments).
