Alternative names (1)
space complexityRandom triples
| Subject | Object |
|---|---|
| gptkb:Longest_Common_Subsequence | O(mn) |
| gptkb:Heapsort | O(1) |
| gptkb:Depth-First_Search | O(V) |
| gptkb:Bellman-Ford_Algorithm | O(V) |
| gptkb:Depth-first_search | O(V) |
| gptkb:Aho-Corasick_algorithm | O(m) |
| gptkb:Mergesort | O(n) |
| gptkb:Greedy_Best-First_Search | O(b^m) |
| gptkb:Count-Min_Sketch | O(w × d) |
| gptkb:Munro–Paterson_algorithm | O(k) |
| gptkb:Roy–Floyd–Warshall_algorithm | O(n^2) |
| gptkb:Breadth-first_search | O(V) |
| gptkb:breadth-first_search | O(V) |
| gptkb:Bellman-Ford_algorithm | O(V) |
| gptkb:LogLog_algorithm | O(log log n) |
| gptkb:Breadth-First_Search | O(V) |
| gptkb:meet-in-the-middle_algorithm | O(2^{n/2}) |
| gptkb:Boyer-Moore-Horspool_algorithm | O(|Σ|) |
| gptkb:vEB_tree | O(U) |
| gptkb:suffix_tree | O(n) |