This article will summarize about sorting algorithms, how they were named, and why use one over another.
Full information is in wikipedia already.
All opinions below are based on the simplest implementation of these sorting algorithms. There are many improved
versions e.g. in-place Merge Sort, Quick Sort with O(NlogN) worst-case…, which are not mentioned here.
This is great article of basic things about big O notation. Big O notation is used for describing the complexity of algorithm, or the cost of doing something in worst case. Just want to sum up here.
more...