Alternative names (1)
space complexityRandom triples
| Subject | Object |
|---|---|
| gptkb:meet-in-the-middle_algorithm | O(2^{n/2}) |
| gptkb:Count-Min_Sketch | O(w × d) |
| gptkb:Tortoise_and_Hare_algorithm | O(1) |
| gptkb:Hirschberg's_algorithm | O(min(m, n)) |
| gptkb:Knuth–Morris–Pratt_algorithm | O(m) |
| gptkb:van_Emde_Boas_tree | O(U) |
| gptkb:Aho-Corasick_algorithm | O(m) |
| gptkb:breadth-first_search | O(V) |
| gptkb:Quicksort | O(log n) |
| gptkb:vEB_tree | O(U) |
| gptkb:IDDFS | O(d) |
| gptkb:Mergesort | O(n) |
| gptkb:Insertion_sort | O(1) |
| gptkb:Floyd's_algorithm_(random_selection) | O(k) |
| gptkb:Schroeppel_and_Shamir's_algorithm_for_subset_sum_problem | O(2^{n/4}) |
| gptkb:Longest_Common_Subsequence | O(mn) |
| gptkb:Schroeppel's_algorithm | O(2^{n/4}) |
| gptkb:Fenwick_tree | O(n) |
| gptkb:Boyer–Moore_majority_vote_algorithm | O(1) |
| gptkb:Floyd's_cycle-finding_algorithm | O(1) |