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)
- Quicksort 快速排序
- Mergesort
- Timsort
- Heapsort
- Bubble
- Insertion
- Selection
- Shell Sort
- Bucket Sort 桶排序
- Radix Sort 基數排序
- Tree Sort
- Counting Sort
- Cubesort
圖操作
refs
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 發布文章使用：只允許注冊用戶才可以訪問！