October 2024
Intermediate to advanced
390 pages
10h 52m
Spanish
Content preview from Algoritmos en pocas palabras, 2ª edición
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 11. Categorías de algoritmos emergentes
Este trabajo se ha traducido utilizando IA. Agradecemos tus opiniones y comentarios: translation-feedback@oreilly.com
Los capítulos anteriores describían algoritmos que resuelven problemas comunes. Obviamente, en tu carrera de programador te encontrarás con retos que no encajan en ninguna categoría común, así que este capítulo presenta cuatro enfoques algor ítmicos para resolver problemas.
Otro cambio en este capítulo es que se centra en la aleatoriedad y la probabilidad. Éstas se utilizaban en capítulos anteriores cuando se analizaba el comportamiento del caso medio de los algoritmos. Aquí la aleatoriedad puede convertirse en una parte esencial de un algoritmo. De hecho, los algoritmos probabilísticos que describimos son alternativas interesantes a los algoritmos deterministas. Ejecutar el mismo algoritmo con la misma entrada en dos momentos distintos puede proporcionar respuestas muy diferentes. A veces toleraremos respuestas erróneas o incluso afirmaciones de que no se ha encontrado ninguna solución.
Variaciones sobre un tema
Los algoritmos anteriores de este libro resuelven instancias de un problema dando una respuesta exacta en un ordenador secuencial y determinista. Es interesante considerar la relajación de estos tres supuestos:
- Algoritmos de aproximación
-
En lugar de buscar una respuesta exacta para un problema, acepta soluciones que se aproximen a la respuesta verdadera, pero que no sean necesariamente tan buenas como ...
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.