Alternative names (1)
space complexityRandom triples
| Subject | Object |
|---|---|
| gptkb:Baby-step_giant-step_algorithm | O(sqrt(n)) |
| gptkb:Insertion_sort | O(1) |
| gptkb:Floyd-Warshall_algorithm | O(n^2) |
| gptkb:Dual-Pivot_Quicksort | O(log n) |
| gptkb:McCreight's_algorithm | O(n) |
| gptkb:Schroeppel_and_Shamir's_algorithm_for_subset_sum_problem | O(2^{n/4}) |
| gptkb:Randomized_Quicksort | O(log n) |
| gptkb:van_Emde_Boas_tree | O(U) |
| gptkb:Bellman–Ford_algorithm | O(V) |
| gptkb:Breadth-first_search | O(V) |
| gptkb:Bellman-Ford_Algorithm | O(V) |
| gptkb:Aho-Corasick_algorithm | O(m) |
| gptkb:Mergesort | O(n) |
| gptkb:Greedy_Best-First_Search | O(b^m) |
| gptkb:TimSort | O(n) |
| gptkb:The_Quicksort_Algorithm | O(log n) |
| gptkb:Boyer-Moore_majority_vote_algorithm | O(1) |
| gptkb:IDDFS | O(d) |
| gptkb:Munro–Paterson_algorithm | O(k) |
| gptkb:Tarjan's_Algorithm | O(V) |