October 2024
Intermediate to advanced
390 pages
10h 52m
Spanish
Content preview from Algoritmos en pocas palabras, 2ª ediciónBecome 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.
Índice
Símbolos
- * (operador de multiplicación), Operaciones de referencia
- ** (operador de exponenciación), Operaciones de referencia
- 15-puzzle, Representando al Estado
- 8-puzzle, Buscar árboles
- 8-Problema de Queens, estimación del tamaño de un árbol de búsqueda
- == operador, Solución
- Notación "Big O", límites inferior y superior
- ≅ (aproximadamente iguales), Comparación de valores en coma flotante
A
- Algoritmo A*Search, A*Search
- listas de adyacencia, grafos-grafos, análisis de grafos
- matriz de adyacencia, grafos, algoritmo de Dijkstra para grafos densos, análisis de grafos
- Heurística Akl-Toussaint, Análisis de soluciones
- algoritmos
- Adición, Rendimientolineal-Rendimiento lineal
- algoritmos de aproximación, Variaciones sobre untema-Análisis
- Bentley-Faust-Preparata, Aproximación
- Bisección, Comportamiento Log n
- búsqueda ciega, funciones heurísticas de longitud de trayectoria
- bloques de construcciónde, Bloques de construcción dealgoritmos-Cantidades especiales
- Búsqueda de recuento, en el mejor de los casos
- tratar con abstracciones computacionales(ver algoritmos de geometría computacional)
- tratar redes de vértices y perímetros(ver algoritmos de flujo de red)
- definida, comprender el problema
- categorías emergentesde, Categorías emergentes de algoritmos-Estimarel tamaño de un árbol de búsqueda
- tiempo de cálculo previsto, Matemáticas de los algoritmos
- (véase también matemáticas)
- Exponenciación por cuadratura, operaciones de referencia
- para consultas de búsqueda(ver estructuras de árbol espaciales)
- GCD,Cálculos de rendimiento ...
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.