Alternative names (1)
space complexityRandom triples
| Subject | Object |
|---|---|
| gptkb:Munro–Paterson_algorithm | O(k) |
| gptkb:IDDFS | O(d) |
| gptkb:Fenwick_tree | O(n) |
| gptkb:Knuth–Morris–Pratt_algorithm | O(m) |
| gptkb:LogLog_algorithm | O(log log n) |
| gptkb:Baby-step_giant-step_algorithm | O(sqrt(n)) |
| gptkb:TimSort | O(n) |
| gptkb:meet-in-the-middle_algorithm | O(2^{n/2}) |
| gptkb:HyperLogLog_algorithm | O(log log n) |
| gptkb:Longest_Common_Subsequence | O(mn) |
| gptkb:vEB_tree | O(U) |
| gptkb:Floyd_Loop | O(1) |
| gptkb:y-fast_trie | O(n) |
| gptkb:Greedy_Best-First_Search | O(b^m) |
| gptkb:Tarjan's_Algorithm | O(V) |
| gptkb:Meet_in_the_Middle | O(2^{n/2}) |
| gptkb:Boyer-Moore_majority_vote_algorithm | O(1) |
| gptkb:Randomized_Quicksort | O(log n) |
| gptkb:Timsort | O(n) |
| gptkb:Iterative_Deepening_Depth-First_Search | O(d) |