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.15. Preguntas de discusión
Dibuje una pila de llamadas para el problema de la torres de Hanoi. Suponga que empieza con una pila de tres discos.
Usando las reglas recursivas tal como se describieron, dibuje un triángulo de Sierpinski usando papel y lápiz.
Usando el algoritmo de programación dinámica para dar las vueltas, encuentre el menor número de monedas que usted podría usar para completar unas vueltas de 33 centavos. Además de las monedas usuales, suponga que usted tiene una moneda de 8 centavos.
You have attempted
1 of
1 activities on this page
