Tag algorithm-analysis - Esta é a página 168 - GeneraCodice

Compute relational composition in $O(|E||V|)$

https://www.generacodice.com/pt/articolo/1107826/compute-relational-composition-in-o-e-v

graph-theory - algorithms - algorithm-analysis - check-my-algorithm

cs.stackexchange

How to prove that BFS directed-graph traversal algorithm terminates?

https://www.generacodice.com/pt/articolo/1102190/how-to-prove-that-bfs-directed-graph-traversal-algorithm-terminates

algorithms - algorithm-analysis - correctness-proof

cs.stackexchange

How to prove that the pre-order tree traversal algorithm terminates?

https://www.generacodice.com/pt/articolo/1102125/how-to-prove-that-the-pre-order-tree-traversal-algorithm-terminates

data-structures - induction - algorithms - algorithm-analysis - correctness-proof

cs.stackexchange

Upper-bounding the number of comparisons for Sorting to $\Theta(n)$ using a physically big number like Number of Particles in the Universe

https://www.generacodice.com/pt/articolo/1102076/upper-bounding-the-number-of-comparisons-for-sorting-to-theta-n-using-a-physically-big-number-like-number-of-particles-in-the-universe

sorting - algorithm-analysis

cs.stackexchange

Finding the number of leaves in a imbalanced recursion tree

https://www.generacodice.com/pt/articolo/1101949/finding-the-number-of-leaves-in-a-imbalanced-recursion-tree

asymptotics - algorithm-analysis - recurrence-relation

cs.stackexchange

Why do the swap step in Prim's algorithm for minimum spanning trees?

https://www.generacodice.com/pt/articolo/1101831/why-do-the-swap-step-in-prim-s-algorithm-for-minimum-spanning-trees

graph-theory - algorithms - algorithm-analysis - greedy-algorithms - spanning-trees

cs.stackexchange

Computing the running time of a divide-by-4-and-conquer algorithm

https://www.generacodice.com/pt/articolo/1101755/computing-the-running-time-of-a-divide-by-4-and-conquer-algorithm

algorithms - algorithm-analysis - runtime-analysis - recurrence-relation

cs.stackexchange

Why does heapsort run in $\Theta(n \log n)$ instead of $\Theta(n^2 \log n)$ time?

https://www.generacodice.com/pt/articolo/1101734/why-does-heapsort-run-in-theta-n-log-n-instead-of-theta-n-2-log-n-time

sorting - algorithms - landau-notation - algorithm-analysis

cs.stackexchange

What constitutes one operation/cycle/move in the RAM model?

https://www.generacodice.com/pt/articolo/1099259/what-constitutes-one-operation-cycle-move-in-the-ram-model

time-complexity - algorithms - algorithm-analysis - machine-models

cs.stackexchange

Does Quicksort always have quadratic runtime if you choose a maximum element as pivot?

https://www.generacodice.com/pt/articolo/1098884/does-quicksort-always-have-quadratic-runtime-if-you-choose-a-maximum-element-as-pivot

sorting - time-complexity - algorithms - algorithm-analysis - runtime-analysis

cs.stackexchange

Resultados encontrados: 1727