Alternative names (1)
space complexityRandom triples
| Subject | Object |
|---|---|
| gptkb:Breadth-First_Search | O(V) |
| gptkb:breadth-first_search | O(V) |
| gptkb:vEB_tree | O(U) |
| gptkb:LogLog_algorithm | O(log log n) |
| gptkb:Boyer-Moore-Horspool_algorithm | O(|Σ|) |
| gptkb:TimSort | O(n) |
| gptkb:Floyd's_cycle-finding_algorithm | O(1) |
| gptkb:McCreight's_algorithm | O(n) |
| gptkb:Tortoise_and_Hare_algorithm | O(1) |
| gptkb:Tarjan's_Algorithm | O(V) |
| gptkb:tortoise_and_hare_algorithm | O(1) |
| gptkb:Timsort | O(n) |
| gptkb:Floyd_Loop | O(1) |
| gptkb:HyperLogLog_algorithm | O(log log n) |
| gptkb:Depth-First_Search | O(V) |
| gptkb:Bellman-Ford_Algorithm | O(V) |
| gptkb:Hirschberg's_algorithm | O(min(m, n)) |
| gptkb:Schroeppel_and_Shamir's_algorithm_for_subset_sum_problem | O(2^{n/4}) |
| gptkb:Mergesort | O(n) |
| gptkb:Boyer–Moore_majority_vote_algorithm | O(1) |