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 4. Algoritmos de ordenación
Este trabajo se ha traducido utilizando IA. Agradecemos tus opiniones y comentarios: translation-feedback@oreilly.com
Numerosos cálculos y tareas se simplifican ordenando adecuadamente la información de antemano. La búsqueda de algoritmos de ordenación eficaces dominó los primeros tiempos de la informática. De hecho, gran parte de las primeras investigaciones en algoritmos se centraron en ordenar colecciones de datos que eran demasiado grandes para que los ordenadores de la época pudieran almacenarlas en la memoria. Como los ordenadores actuales son mucho más potentes que los de hace 50 años, el tamaño de los conjuntos de datos que se procesan es ahora del orden de terabytes de información. Aunque no se te pida que clasifiques conjuntos de datos tan enormes, es probable que tengas que clasificar un gran número de elementos. En este capítulo, cubrimos los algoritmos de ordenación más importantes y presentamos los resultados de nuestras pruebas comparativas para ayudarte a seleccionar el mejor algoritmo de ordenación a utilizar en cada situación.
Terminología
Una colección de elementos comparables A se presenta para ser ordenada en su lugar; utilizamos las notaciones A[i] y ai para referirnos al i-ésimo elemento de la colección. Por convención, el primer elemento de la colección es A[0]. Utilizamos A[bajo, bajo + n) para referirnos a la subcolección A[bajo] ... A[bajo + n - 1] de n elementos, mientras que A[bajo, bajo + n] contiene n + 1 elementos. ...
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.