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 5. Buscando en
Este trabajo se ha traducido utilizando IA. Agradecemos tus opiniones y comentarios: translation-feedback@oreilly.com
Dada una colección C de elementos, hay dos consultas fundamentales:
- Existencia
-
¿Contiene C un elemento objetivo? Dada una colección C, a menudo simplemente queremos saber si la colección ya contiene un elemento determinado t. La respuesta a una consulta de este tipo es
truesi existe un elemento en la colección que coincide con el objetivo deseado t, ofalsesi no es así. - Búsqueda asociativa
-
Devuelve la información asociada en la colección C a un valor clave objetivo k. Una clave suele estar asociada a una estructura compleja llamada valor. La búsqueda recupera o sustituye este valor.
Los algoritmos de este capítulo describen formas específicas de estructurar los datos para procesar más eficazmente las consultas de búsqueda. Por ejemplo, puedes ordenar la colección Cutilizando los algoritmos de ordenación tratados anteriormente en el Capítulo 4. Como veremos, la ordenación mejora el rendimiento de las consultas, pero mantener una colección ordenada conlleva otros costes, sobre todo cuando se insertan o eliminan elementos con frecuencia .
En última instancia, el rendimiento se basa en cuántos elementos inspecciona un algoritmo al procesar una consulta. Utiliza la siguiente guía para seleccionar el mejor algoritmo para ti:
- Pequeñas colecciones
-
La Búsqueda Secuencial ofrece la implementación más sencilla y se implementa como una construcció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,
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.