An in-place sorting algorithm is one that uses no additional array for storage. A sorting algorithm is stable if duplicate elements remain in the same relative position after sorting. The main contents of this lecture include all of the following: Lower bounds for sorting, decision tree, counting sort, linear time sorting. In this lecture, you find clear explanations of Counting Sort: Stable. |