Big O Complexity Graph

Big O === O()

Quicksort O(n log(n)) O(n log(n)) O(n^2) O(log(n))

Mergesort O(n log(n)) O(n log(n)) O(n log(n)) O(n)

Timsort O(n) O(n log(n)) O(n log(n)) O(n)

Heapsort O(n log(n)) O(n log(n)) O(n log(n)) O(1)

Bubble Sort O(n) O(n^2) O(n^2) O(1)

Insertion Sort O(n) O(n^2) O(n^2) O(1)

Selection Sort O(n^2) O(n^2) O(n^2) O(1)

Shell Sort O(n) O((nlog(n))^2) O((nlog(n))^2) O(1)

Bucket Sort O(n+k) O(n+k) O(n^2) O(n)

Radix Sort O(nk) O(nk) O(nk) O(n+k)

1. Quicksort 快速排序
2. Mergesort
3. Timsort
4. Heapsort
5. Bubble
6. Insertion
7. Selection
8. Shell Sort
9. Bucket Sort 桶排序
10. Radix Sort 基数排序
11. Tree Sort
12. Counting Sort
13. Cubesort

https://www.techug.com/post/bigo-cheatsheet.html

https://www.bigocheatsheet.com/

https://www.geeksforgeeks.org/analysis-algorithms-big-o-analysis/

http://www.souravsengupta.com/cds2016/lectures/Complexity_Cheatsheet.pdf

---

---

xgqfrms 2012-2020

www.cnblogs.com 发布文章使用：只允许注册用户才可以访问！

---