排序算法的时间复杂度

Sorting Algorithms and Complexities

Algorithm	Time Complexity	Space Complexity
Bubble sort	$O(n^{2})$	$O(n)$ - in place, $O(1)$ extra space.
Insertion sort	$O(n^{2})$	$O(n)$ - in place, $O(1)$ extra space.
Selection sort	$O(n^{2})$	$O(n)$ - in place, $O(1)$ extra space.
Merge sort	$O(nlog n)$	$O(n)$ - $O(n)$ extra space.
Heap sort	$O(nlog n)$	$O(n)$ - in place, $O(1)$ extra space.
Quicksort	$O(n^{2})$ - $O(nlog n)$ expected, andwith high probability.	$O(1)$ inplace.
Introsort	$O(nlog n)$	$O(n)$ - $O(log n)$ extra space.
Counting sort	$O(k+n)$	$O(k)$
Timsort	$O(n)$ Best case $O(nlog n)$ Worst Case	$O(n)$