Repository navigation
docs(conferences): animated HTML deck for 2026 lecture 9, recursion - #350
Merged
Merged
Conversation
…p/recursion closing slide in lecture 9
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Presentación de la conferencia 9 (recursión), armada sobre la plantilla de la conferencia 8 según
know-how/presentaciones.md.El arco va en cuatro partes:
fac3→fac2→fac1, tres funciones distintas, y anima cómo cada llamada se apila, espera y sale. Después las junta enfactorial(n).mcd,factorial_colacon acumulador, la traducción a ciclo, la búsqueda binaria recursiva y elRecursionErroren vivo.aplanar.fib(n), con las llamadas repetidas en rojo.Animaciones nuevas:
Pila,HanoiyArbol, sobre una base comúnPasoque cumple el contrato de controladores del know-how. El puentefac1/fac2/fac3solo está en la presentación; el capítulo no cambia.Comprobación:
uv run conferences/2026/probar_presentacion.py conferences/2026/09-recursion/presentacion.htmlda 30 diapositivas, 12 corridas de animación, 0 desbordes, 0 sin final y 0 errores. Los mensajes finales coinciden con Python: 9, 15 y 25 llamadas parafib(4..6), y 7 y 15 movimientos en Hanói. Las salidas vienen de la caché del libro.