Alternative names (1)
space complexityRandom triples
| Subject | Object |
|---|---|
| gptkb:Tarjan's_Algorithm | O(V) |
| gptkb:Randomized_Quicksort | O(log n) |
| gptkb:y-fast_trie | O(n) |
| gptkb:Munro–Paterson_algorithm | O(k) |
| gptkb:Heap_sort | O(1) |
| gptkb:Heapsort | O(1) |
| gptkb:Floyd-Warshall_Algorithm | O(n^2) |
| gptkb:IDDFS | O(d) |
| gptkb:Breadth-first_search | O(V) |
| gptkb:Schroeppel's_algorithm | O(2^{n/4}) |
| gptkb:breadth-first_search | O(V) |
| gptkb:A*_Search_Algorithm | O(b^d) |
| gptkb:Fortune's_algorithm | O(n) |
| gptkb:meet-in-the-middle_algorithm | O(2^{n/2}) |
| gptkb:Longest_Common_Subsequence | O(mn) |
| gptkb:Roy–Floyd–Warshall_algorithm | O(n^2) |
| gptkb:Mergesort | O(n) |
| gptkb:suffix_tree | O(n) |
| gptkb:Quicksort | O(log n) |
| gptkb:Depth-First_Search | O(V) |