Alternative names (1)
space complexityRandom triples
| Subject | Object |
|---|---|
| gptkb:Meet_in_the_Middle | O(2^{n/2}) |
| gptkb:breadth-first_search | O(V) |
| gptkb:Roy-Floyd-Warshall_algorithm | O(n^2) |
| gptkb:Count-Min_Sketch | O(w × d) |
| gptkb:Heapsort | O(1) |
| gptkb:Fenwick_tree | O(n) |
| gptkb:A*_Search_Algorithm | O(b^d) |
| gptkb:Bellman–Ford_algorithm | O(V) |
| gptkb:Floyd's_cycle-finding_algorithm | O(1) |
| gptkb:Munro–Paterson_algorithm | O(k) |
| gptkb:Tortoise_and_Hare_algorithm | O(1) |
| gptkb:Boyer-Moore_majority_vote_algorithm | O(1) |
| gptkb:McCreight's_algorithm | O(n) |
| gptkb:vEB_tree | O(U) |
| gptkb:Dual-Pivot_Quicksort | O(log n) |
| gptkb:suffix_tree | O(n) |
| gptkb:Hirschberg's_algorithm | O(min(m, n)) |
| gptkb:Schroeppel's_algorithm | O(2^{n/4}) |
| gptkb:van_Emde_Boas_tree | O(U) |
| gptkb:BFS | O(V) |