Tema 1 - Diseño de algoritmos
Algoritmos recursivos
Análisis de complejidad
Algoritmos de ordenación
Diccionarios - Algoritmos
Código de árboles binarios de búsqueda:
Animación de algoritmos:
Otro material docente
- Introduction to algorithms
MIT Open Courseware
ocw.mit.edu/courses
- 1. Algorithm thinking
- 3. Insertion sort, merge sort
- 5. Binary search trees, BST sort
- 8. Hashing and chaining
- Introduction to Algorithms
T.H. Cormen et al. 3rd ed. 2009
- 2.1. Insertion sort
- 2.2. Analysing algorithms
- 2.3. Designing algorithms
- 3. Growth funcions
- 3.1. Asymptotic notation
- 3.2. Standard notations and common functions
- 4.3. The substitution method for solving recurrences
- 4.4. The recursion-tree method for solving recurrences
- 7. Quicksort
- 11. Hash Tables
- 12. Binary Search Trees
- Algorithms
R. Sedgewick, K. Wayne, 4th ed. 2011
http://algs4.cs.princeton.edu/home/
- 1.4. Analysys of algorithms
- 2. Sorting
- 2.1. Elementary sorts
- 2.2. Mergesort
- 2.3. Quicksort
- 3. Searching
- 3.1. Symbol tables
- 3.2. Binary search trees
- 3.4. Hash tables
- The Algorithm Design Manual
Steve S. Kiena, 2013
- 2. Algorithm analysis
- 2.2. The big oh notation
- 2.3. Growth rates and dominance relations
- 2.4. Working with the big oh
- 3.3. Dictionaries
- 3.4. Binary search trees
- 3.7. Hashing and strings
- 4. Sorting and searching
- 12.1. Dictionaries
- Data structures &: Problem solving using java
M.A. Weiss, 2013
- 5. Algorithm analysis
- 8. Sorting algorithms
- 17. Trees
- 18. Binary search trees
- 19. Hash tables