排序算法的时间复杂度

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)$

查看全文

相关阅读:
Lintcode415-Valid Palindrome-Medium
Lintcode455-StudentID-Easy
Lintcode241-String to Integer
Lintcode521-Remove Duplicate Numbers in Array-Easy
Lintcode214-Max of Array-Naive
面试一个小公司,TPM相关概念
 C#, introduction, general
make命令和makefile
OS_Architecture_MemoryHierarchy
Leecode_98_Validate_Binary_Search_Tree