September 2024
Intermediate to advanced
414 pages
10h 44m
Spanish
Content preview from Un enfoque funcional de Java
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.
Capítulo 12. Recursión
Este trabajo se ha traducido utilizando IA. Agradecemos tus opiniones y comentarios: translation-feedback@oreilly.com
La recursividad es un enfoque para resolver un problema que puede descomponerse en versiones más pequeñas de sí mismo. Muchos desarrolladores ven la recursividad como otro enfoque -a menudo complicado- de la resolución de problemas basada en la iteración. Aun así, es bueno conocer diferentes técnicas para determinados grupos de problemas de forma funcional.
Este capítulo muestra la idea general que hay detrás de la recursividad, cómo se implementan los métodos recursivos y su lugar en tu código Java en comparación con otras formas de iteración.
¿Qué es la recursión?
En "Recursividad", has visto una ilustración del cálculo de factoriales: el producto de todos los enteros positivos menores o iguales que el parámetro de entrada. Muchos libros, guías y tutoriales utilizan factoriales para demostrar la recursividad porque es un problema perfecto para resolver parcialmente, y también será el primer ejemplo de este capítulo.
Cada paso del cálculo de factoriales se descompone en el producto del parámetro de entrada y el resultado de la siguiente operación factorial. Cuando el cálculo llega a fac(1)-definido como "1"- la cadena termina y proporciona el valor al paso anterior. Los pasos completos se pueden ver en la Ecuación 12-1.
Ecuación 12-1. Representación formal de un cálculo factorial
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access
More than 5,000 organizations count on O’Reilly
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.Julian F.
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.Addison B.
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.Amir M.
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.