Before you keep reading...
Runestone Academy can only continue if we get support from individuals like you. As a student you are well aware of the high cost of textbooks. Our mission is to provide great books to you for free, but we ask that you consider a $10 donation, more if you can or less if $10 is a burden.
Before you keep reading...
Making great stuff takes time and $$. If you appreciate the book you are reading now and want to keep quality materials free for other students please consider a donation to Runestone Academy. We ask that you consider a $10 donation, but if you can give more thats great, if $10 is too much for your budget we would be happy with whatever you can afford as a show of support.
4.9. Problemas recursivos complejos
En las secciones anteriores examinamos algunos problemas que son relativamente fáciles de resolver y algunos problemas gráficamente interesantes que nos pueden ayudar a obtener un modelo mental de lo que está sucediendo en un algoritmo recursivo. En esta sección veremos algunos problemas que son realmente difíciles de resolver usando un estilo de programación iterativo pero que son muy elegantes y fáciles de resolver usando la recursividad. Finalizaremos examinando un problema engañoso que al principio parece que tiene una solución recursiva elegante pero que, de hecho, no la tiene.
You have attempted
1 of
1 activities on this page
