Alternative names (1)
space complexityRandom triples
| Subject | Object |
|---|---|
| gptkb:Meet_in_the_Middle | O(2^{n/2}) |
| gptkb:Depth-first_search | O(V) |
| gptkb:Bellman–Ford_algorithm | O(V) |
| gptkb:breadth-first_search | O(V) |
| gptkb:Greedy_Best-First_Search | O(b^m) |
| gptkb:Count-Min_Sketch | O(w × d) |
| gptkb:Depth-First_Search | O(V) |
| gptkb:Roy–Floyd–Warshall_algorithm | O(n^2) |
| gptkb:Bellman-Ford_algorithm | O(V) |
| gptkb:Floyd–Warshall_algorithm | O(n^2) |
| gptkb:Tortoise_and_Hare_algorithm | O(1) |
| gptkb:Boyer–Moore_majority_vote_algorithm | O(1) |
| gptkb:van_Emde_Boas_tree | O(U) |
| gptkb:Boyer-Moore_majority_vote_algorithm | O(1) |
| gptkb:Randomized_Quicksort | O(log n) |
| gptkb:Iterative_Deepening_Depth-First_Search | O(d) |
| gptkb:The_Quicksort_Algorithm | O(log n) |
| gptkb:Dual-Pivot_Quicksort | O(log n) |
| gptkb:suffix_tree | O(n) |
| gptkb:meet-in-the-middle_algorithm | O(2^{n/2}) |