worstCaseTimeComplexity
17
triples
GPTKB property
Random triples
| Subject | Object |
|---|---|
| gptkb:Knuth–Morris–Pratt_algorithm | O(n + m) |
| gptkb:Subset_Sum_Problem | O(2^n) |
| gptkb:Push–relabel_algorithm | O(V^2 E) |
| gptkb:Binary_Search_Tree | O(n) |
| gptkb:Randomized_Quicksort | O(n^2) |
| gptkb:Rabin-Karp_algorithm | O(nm) |
| gptkb:Shell_sort | O(n^2) |
| gptkb:TimSort | O(n log n) |
| gptkb:Dual-Pivot_Quicksort | O(n^2) |
| gptkb:AStar | O(b^d) |
| gptkb:Subset_Sum | O(2^n) |
| gptkb:Insertion_sort | O(n^2) |
| gptkb:The_Quicksort_Algorithm | O(n^2) |
| gptkb:Quicksort | O(n^2) |
| gptkb:Bellman–Ford_algorithm | O(VE) |
| gptkb:Timsort | O(n log n) |
| gptkb:Jarvis_march | O(nh) |