Embedded Files
Links and Other Resources
Links and Other Resources
Online courses
- Udacity CS215 Intro to Algorithms - crunching social networks
- Algorithmic Toolbox Coursera University of California San Diego, Higher School of Economics Russia
- Udacity CS212 Design of Computer Programs
- Udacity CS213 Intro to Theoretical Computer Science
- E. Demaine, R. Rivest and S. Devadas, Introduction to Algorithms Course, MIT OpenCourseware, 2008
- Visualizing data structures and algorithms through animation
- Pancake sorting problem
- C. Leiserson and E. Demaine, Introduction to Algorithms Course, MIT OpenCourseware, 2005
- http://disi.unal.edu.co/~algoritmos
- CMU Great Theoretical Ideas In Computer Science http://www.cs.cmu.edu/~15251/
Python
- Página oficial en Inglés y Español
- Tutorial Oficial de Python: Inglés y Español (vaya primero a la sección 4)
- Cursos interactivos de Python
- R. González-Duque, Python para todos, 2010
- Recursos adicionales en Wikipedia
- Distribuciones:
- Windows: distribución oficial, IronPython (basado en .net e integrado con Visual Studio)
- Linux, FreeBSD, OS X y otros sabores de Unix: si es usuario de alguno de estos SO pues muy seguramente ya lo tiene instalado y además ya sabe que tiene que hacer ;)
On-line IDEs
ICPC
- Slides talk D. Niquefa - Grupo de Maratones UN - www.facebook.com/groups/maratonesunbogota/
- codeforces.com
- icpc.baylor.edu
- UVa Online Judge
- a2oj.com
- icpc.baylor.edu/compete/problems
- Sphere Online Judge
- CS 97SI: Introduction to Programming Contests - Jaehyun Park - Stanford University
- CS3233 Competitive Programming - old teaching materials - Steven Halim - NUS
IEEEXtreme
- Slides talk J.S. Dussan IEEEXtreme 10.0 UN
- CONCURSO de Estrategias de Algorítmicas de Negociación en la Bolsa Millonaria
- Quicksort DISI Quicksort
- Lecture 4: Quicksort, Randomized Algorithms MIT Introduction to Algorithms (SMA 5503 ) Fall 2005
- DISI Applets
- Distributional Convergence for the Number of Symbol Comparisons Used by QuickSort from JA Fill, Johns Hopkings U.
- QuickSelect Lecture 6: Order Statistics, Median MIT Introduction to Algorithms (SMA 5503 ) Fall 2005
- Distributional Convergence for the Number of Symbol Comparisons Used by QuickSelect.from JA Fill, Johns Hopkings U
- Montículos Heapsort DISI Heapsort
- Lecture 4: Heaps and Heap Sort MIT Introduction to Algorithms( 6.006) Fall 2011
- VisuAlgo - visualising data structures and algorithms through animation
- Sorting Algorithms Demo - Java
- Udacity CS 215 Lesson 4: It’s Who You Know Keeping track of your best friends using heaps
- Programación dinámica
- Lecture 15: Dynamic Programming, Longest Common Subsequence MIT Introduction to Algorithms (SMA 5503 ) Fall 2005
- CS 97SI: IntroVduction to Programming Contests, Jaehyun Park, Stanford University, 04-dynamic-programming.pdf
- CS3233 Competitive Programming (old teaching materials), Steven Halim, NUS, week04_dp_1.pdf, week04_dp_2.pdf
- Camino más corto desde una fuente y camino más corto entre todas las parejas
- DISI decompositions_of_graphs.rar
- DISI ch04-paths-in-graphs.ppt
- Lecture 17: Shortest Paths I: Properties, Dijkstra's Algorithm, Breadth-first Search , Lecture 18: Shortest Paths II: Bellman-Ford, Linear Programming, Difference Constraints and Lecture 19: Shortest Paths III: All-pairs Shortest Paths, Matrix Multiplication, Floyd-Warshall, Johnson MIT Introduction to Algorithms (SMA 5503 ) Fall 2005
- CS3233 Competitive Programming (old teaching materials), Steven Halim, NUS, week05_graph_1.pdf
- Udacity CS 215 Lesson 5: Strong and Weak Bonds Working with social networks with edge weights.
- Clases de complejidad
- (6.2) Problemas NP-completos
- DISI calculabilidad.zip
- DISI complejidad.zip
- Udacity CS 215 Lesson 6: Hardness of Network Problems Exploring what it means for a social network problem to be harder than other.
- Udacity CS 215 Lesson 7: Conclusion Using your knowledge.
- Udacity CS 313 Intro to Theoretical Computer Science Lectures Lesson 1 and 2
Report abuse