排序算法的时间复杂度

最新推荐文章于 2025-08-13 10:25:05 发布

weixin_33728268

最新推荐文章于 2025-08-13 10:25:05 发布

阅读量43

点赞数

CC 4.0 BY-SA版权

文章标签：数据结构与算法 php

原文链接：http://www.cnblogs.com/tigerisland/p/7564943.html

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(n\log n)$	$O(n)$ - $O(n)$ extra space.
Heap sort	$O(n\log n)$	$O(n)$ - in place, $O(1)$ extra space.
Quicksort	$O(n^{2})$ - $O(n\log n)$ expected, andwith high probability.	$O(1)$ inplace.
Introsort	$O(n\log n)$	$O(n)$ - $O(\log n)$ extra space.
Counting sort	$O(k+n)$	$O(k)$
Timsort	$O(n)$ Best case $O(n\log n)$ Worst Case	$O(n)$