Alternative names (1)
space complexityRandom triples
| Subject | Object |
|---|---|
| gptkb:Knuth–Morris–Pratt_algorithm | O(m) |
| gptkb:Insert_Interval | O(n) |
| gptkb:Schroeppel's_algorithm | O(2^{n/4}) |
| gptkb:Depth-first_search | O(V) |
| gptkb:Floyd–Warshall_algorithm | O(n^2) |
| gptkb:A*_Search_Algorithm | O(b^d) |
| gptkb:The_Quicksort_Algorithm | O(log n) |
| gptkb:Count-Min_Sketch | O(w × d) |
| gptkb:Dual-Pivot_Quicksort | O(log n) |
| gptkb:x-fast_trie | O(n log U) |
| gptkb:Breadth-First_Search | O(V) |
| gptkb:Iterative_Deepening_Depth-First_Search | O(d) |
| gptkb:Floyd-Warshall_Algorithm | O(n^2) |
| gptkb:Roy-Floyd-Warshall_algorithm | O(n^2) |
| gptkb:Bellman–Ford_algorithm | O(V) |
| gptkb:suffix_tree | O(n) |
| gptkb:Boyer–Moore_majority_vote_algorithm | O(1) |
| gptkb:Boyer-Moore-Horspool_algorithm | O(|Σ|) |
| gptkb:Fortune's_algorithm | O(n) |
| gptkb:Randomized_Quicksort | O(log n) |