Tricky Algo Analysis - Recursion

Pubblicato il: 13 gennaio 2024
sul canale di: Red Black Tech

2,965

It's easy to forget about the process call stack and each of the stack frames generated when running a recursive function, because you can't easily see the process call stack.

Unfortunately, this makes it easy to incorrectly analyze the space usage of an algorithm.

In this example, we show how to program the factorial function recursively so that the process stack grows, causing extra space to be in O(n).

I also programmed the function to have what seems to be an extra parameter: accumulator. Why did I do this? Because it allows for the c++ compiler to optimize for Tail Recursion.

When a function is Tail Recursive, it means the recursive call comes last in the function, so that there is no more work after recursion. If there is no more work after recursion, then there's no need to even add to the process stack because we know we will never need the variables in the stack again.

In questa pagina del sito puoi guardare il video online Tricky Algo Analysis - Recursion della durata di ore minuti seconda in buona qualità , che l'utente ha caricato Red Black Tech 13 gennaio 2024, condividi il link con amici e conoscenti, su youtube questo video è già stato visto 2,965 volte e gli è piaciuto 77 spettatori. Buona visione!

1,090