1. History of Algorithms
Embedded Files
Resources
- Muhammad ibn Musa al-Khwarizmi - Wikipedia
- Quadratic equation - Wikipedia
- Cubic function - Cardano–Tartaglia formula- Wikipedia
- Quartic function - Wikipedia
- Fundamental Theorem of Algebra- Wikipedia
- Galois Theory - Wikipedia
- Galois Theory: Polynomials of Degree 5 and Up, Tokuei Higashino, Union College - williams.edu
2. Computational Thinking and the Hour of Code
- Computational Thinking https://giiestemb.wordpress.com/computational-thinking
- Hour of Code https://giiestemb.wordpress.com/hourofcode/
Resources
- Python
- Python (programming language) - Wikipedia
- Python Software Foundation - Python.org
- Cognitive Class AI - cognitiveclass.ai
- IPython (Interactive Python)
- IPython - Wikipedia
- Colab - https://colab.research.google.com
- Magic Commands % for Jupyter Notebooks
- NumPy
- SciPy
- Matplotlib: Python plotting
- Seaborn: statistical data visualization
- https://seaborn.pydata.org/
- https://pypi.org/project/seaborn/ Python Software Foundation
- Scikit-learn: machine learning in Python
- https://en.wikipedia.org/wiki/Scikit-learn
- https://scikit-learn.org/
- Jeremy Howard: The wonderful and terrifying implications of computers that can learn –TED Talk
- TPOT
- https://epistasislab.github.io/tpot/
- http://automl.info/tpot/
- https://www.automl.org/wp-content/uploads/2018/12/tpot.pdf
- https://www.kaggle.com/thebrownviking20/tpot-a-great-tool-to-automate-your-ml-workflow
- https://towardsdatascience.com/tpot-automated-machine-learning-in-python-4c063b3e5de9
- Genetic Algorithms – Siraj Raval – Learn Python for Data Science #6 – “In this video, we build a Gamma Radiation Classifier and use Genetic Programming to pick the best Machine Learning model + hyper-parameters FOR US in 40 lines of Python.” – Youtube
- The Automated Data Science and Automated Machine Learning Revolution German Hernandez Slides
- Logo (programming language) https://en.wikipedia.org/wiki/Logo_(programming_language)
- Logo Interpreter https://www.calormen.com/jslogo/
- Turtle Academy https://turtleacademy.com/
- Fortran https://en.wikipedia.org/wiki/Fortran
- Lisp (programming language) https://en.wikipedia.org/wiki/Lisp_(programming_language)
- Grace Hopper - COBOL
- Java (programming language) https://en.wikipedia.org/wiki/Java_(programming_language)
- JavaScript https://en.wikipedia.org/wiki/JavaScript
- The Top Programming Languages 2019 - IEEE Spectrum
- Lab1 - "The PyData Toolbox with Scott Sanderson"
- Lab2 - Python Quantopian Lectures
3. Competitive Programming
Ivan Castellanos - Jherson Adrian Medina Correa - Nicolas Eduardo Pardo Arias
- Grupo de Maratones UN: www.facebook.com/groups/maratonesunbogota/
- IEEEXtreme: Slides talk J.S. Dussan
- codeforces.com
- icpc.baylor.edu
- https://www.hackerearth.com/
- https://www.hackerrank.com/
- UVa Online Judge
- icpc.baylor.edu/compete/problems
- CS 97SI: Introduction to Programming Contests - Jaehyun Park - Stanford University
- CS3233 Competitive Programming - old teaching materials - Steven Halim - NUS
- Competitive Programmer's Core Skills Coursera - Saint Petersburg State University
- Competitive Programmer's Handbook PDF - Code Submission Evaluation System Finland - CSES
- Common mistakes to be avoided in Competitive Programming in C++ | Beginners - Geeksforgeeks
- Python - Most frequent problem for beginners (on Hackerearth) - Rishikesh Agrawani - Linkedin
- Quiz CCPL - Septiembre-2019
- Extracredits CCPL - Septiembre-2019
4. New Markets: The Invisible Hand of Algorithms
Resources
- Slides link
- The Stable Marriage Problem [ Book Excerpt]
- The Mathematics Of 1950’s Dating: Who wins The Battle of The Sexes? 15-251 Great Theoretical Ideas in Computer Science CMU Lecture 9 (September 25, 2007) ppt
- Stable Marriage Problem – wikipedia
- Illustrating the Deferred Acceptance Algorithm with R
- Stable Marriage Problem – MRSI – Numberphile – cse.buffalo.edu
- Gale Shapley Algorithm for Stable Matching – S Sawhney – Youtube
- Matching (Graph Theory) - brilliant
- Matching Algorithms (Graph Theory) – brilliant
- Stable matching, as a game – towardsdatascience.com
- Game Theory
- Game Theory - wikipedia
- John Nash y la Teoría de Juegos - Sergio Monsalve - Lecturas Matemáticas Volumen 24 (2003), páginas 137–149 - cienciared
- Teoría de Juegos ¿Hacia Donde vamos? (60 años después de von Neumann y Morgenstern) - Sergio Monsalve - redalyc
- Nota postuma sobre el legado de John Nash - Sergio Monsalve - elespectador
- Dinámica y Opmización- Sergio Monsalve Gómez - FCE UN - pdf
- Game Theory
- “New Market Models and Algorithms” Vijay Vaziarni UCI
- Quiz The Stable Marriage Problem [ Book Excerpt]
- Quiz video reviews and reading review 1
5. Trading Algorithms
Resources
- AlgorithmicTradingMadeEasyForEveryone.ppt
- Quantopian
- Quantopian wikiepdia
- Hello World Example
- Sample Mean Reversion
- Cross-sectional Equity Template Example
- Getting Started on Quantopian for Students w/ Dr. Tom Starke - youtube
6. What is an algorithm? - Time complexity
- What is an algorithm?
- Semantic analysis
- Correctness
- Complexity
- Time complexity
- Elementary operation
- Principle of invariance
Resources
- CLRS I.1
- intro.pdf
- intro.ppt
- Correctness proofs by James Aspnes
- IPython notebook: fibonacci
- https://colab.research.google.com
- Time Complexity of Bubble Sort applet - ungrid
7. Complete search - Brute force
- Andres Ricardo Perez Rojas riperezro@unal.edu.co
Resources
- Slides link
- Chapter 5 Complete search - Competitive Programmer's Handbook. Antti Laaksonen pdf
- Chapter 9 Intro and 9.1 Intelligent exhaustive search - Algorithms. Dasgupta, Papadimitriou and Vazirani
- Quiz Complete Search - Brute Force
8. Asymptotic notation
- Asymptotic notation
- Common functions
Resources
- CLRS I.3
- DVP 0.3
- grofun.pdf
- grofun.ppt
- Lecture 2: Asymptotic Notation; Recurrences; Substitution, Master Method MIT Introduction-to-algorithms 2005
- Videos
9. Incremental/Decremental Paradigm
- Incremental/Decremental Paradigm
- Insertion sort
- Incremental Recurrences
- Decremental - Bubble sort
- Decremental + Efficient Data Structures - Heap Sort
- Binary heaps
- Heap sort
- Priority queues
Resources
- CLRS I.2.1
- incr.pdf
- incr.ppt
- Visualgo sorting
- Visualization Sorting Algorithms Galles UCSF
- IsortTimePlot Applet - ungrid - html - java
- IPython notebook: corrección y análisis de algoritmos
- Lecture 1: Administrivia; Introduction; Analysis of Algorithms, Insertion Sort, Mergesort MIT Introduction-to-algorithms 2005
- Decremental + Efficient Data Structures - Heap Sort
- CLRS II.6
- heapsort.pdf
- heapsort.zip
- VisuAlgo - https://visualgo.net/en/heap
- IPython notebook: montículos
- Lecture 4: Heaps and Heap Sort MIT Introduction to Algorithms( 6.006) Fall 2011
- Udacity CS 215 Lesson 4: It’s Who You Know Keeping track of your best friends using heaps
- Heap Sort Animation Applet html
- Lab5 - Time Complexity
10. Greedy algorithms
Duvan Camilo Albarracin Vargas
Resources
- Grokking 8
- CLRS IV.16
- DVP 5
- Slides link
- Lecture 16: Greedy Algorithms, Minimum Spanning Trees MIT Introduction-to-algorithms 2005
- Quiz Greedy
11 . Divide and Conquer I - Merge Sort
- Divide and Conquer Paradigm
- Merge Sort
- Time Complexity Merge Sort
Resources
- CLRS I.2.2
- DVP 2
- Grokking Algorithms 1
- Binary and Linear Search Visualization
- The famous PhoneBook - Video Clipt CS50 2012 Harvard - youtube
- divcon1.pdf
- divcon1ppt
- Sorting visualizations - visualgo
- Sorting visualizations - Galles UCSF
- Merge-sort with Transylvanian-saxon (German) folk dance - Algorithms - AlgoRythmics - youtube
- MergeSortHawaii applet ungrid
- MergeSortIITK applet ungrid
- IPython notebook: ordenamiento por mezcla
- Sorting comparison demos
- Quiz Divide and Conquer I - review
- Lecture 1: Administrivia; Introduction; Analysis of Algorithms, Insertion Sort, Mergesort MIT Introduction-to-algorithms 2005
- CLRS I.2.2, DVP 2 and Grokking Algorithms 1
12. Divide and Conquer Paradigm II
- Other Examples of D-C
- Chip Testing Problem
- Binary Search
- Convex Hull
- Towers of Hanoi
- Alternative Methods to Solve D-C Recurrences
- Characteristic equation method
- Substitution method
- Master method
- Z transform
Resources
- Grokking 1 and 3
- CLRS I.4
- DVP 2
- divcon2.pdf
- divcon2.ppt
- Convex hull visualization - youtube
- Convex hull visualization - visualgo
- Divide and Conquer, Merger Sort y complejidad de recurrencias - Programacion Competetiva UNAL
- Lecture 2: Asymptotic Notation; Recurrences; Substitution, Master Method MIT Introduction-to-algorithms 2005
- Towers of Hanoi visualization - towersofhanoi.info
- Videos
- Algorithms UN 6.1 Divide and Conquer Paradigm II - Youtube
- Algorithms UN 6.2 Divide and Conquer Paradigm II - Youtube
- Algorithms UN 6.3 Divide and Conquer Paradigm II - Youtube
- Algorithms UN 6.4 Divide and Conquer Paradigm II - Youtube
- Algorithms UN 6.5 Divide and Conquer Paradigm II - Youtube
- Algorithms UN 6.6 Divide and Conquer Paradigm II - Youtube
13. Dynamic Programming
Nicolas Eduardo Pardo Arias
Resources
- Grokking 9
- Laaksonen I.7
- CLRS IV.15
- DVP 6
- Slides link
- Fibonnaci
- An introduction to the theory of dynamic programming - R, Bellman - RAND -1954 - Dtic.Mil - pdf
- Programación Dinámica UN - Programacion Competetiva UNAL
- Lecture 15: Dynamic Programming, Longest Common Subsequence MIT Introduction to Algorithms (SMA 5503 ) Fall 2005
- Lecture 10 Dynamic Programming Ackerman FSU
- Competitive Programmer's Handbook PDF - Chapter 7 Dynamic Programming
- IPython notebook: timeitexmaples
14. Graph Algorithms
Jherson Adrian Medina Correa
- Traversals
- Shortest paths
Resources
- Grokking 6 and 7
- Laaksonen II
- DVP 3 and 4
- CLRS VI
- Slides link
- paths in graphs.pdf
- decompositions of graphs1.pdf
- decompositions of graphs2.pdf
- IPython notebook: búsquedas
- IPython notebook: Dijksitra
- IPython notebook: Djkstra_eppstein
- IPython notebook: BellmanFord
- IPython notebook: FloydWarshall
- Graph Traversals (BFS-DFS) - visualalgo
- Single-Source Shortest Paths (SSSP) - visualalgo
- Lecture 17: Shortest Paths I: Properties, Dijkstra's Algorithm, Breadth-first Search MIT Introduction-to-algorithms 2005
- Lecture 18: Shortest Paths II: Bellman-Ford, Linear Programming, Difference Constraints MIT Introduction-to-algorithms 2005
- 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
X. Randomization - Randomized Select and Quick Sort
- Medians and Order Statistics
- Randomized Select
- Deterministic Select
- Quicksort
- Randomized Quicksort
Resources
- CLRS II.7
- DVP 2.4
- randomizedselectquicksort.pdf
- randomizedselectquicksort.ppt
- Lecture 6: Order Statistics, Median MIT Introduction to Algorithms (SMA 5503 ) Fall 2005
- Lecture 4: Quicksort, Randomized Algorithms MIT Introduction to Algorithms (SMA 5503 ) Fall 2005
- Quick-sort with Hungarian (Küküllőmenti legényes) folk dance - AlgoRythmics - youtube
- Quicksort form interactivepython.org
- IPython notebook:quicksort from interactivepython.org
- IPython notebook: randomquicksort distr comps(tiempo)
- IPython notebook: quicksort two finger comp distrib (tiempo)
- Sorting visualizations - visualgo
- Sorting visualizations - Galles UCSF
- Quicksort visualization applet - ungrid
- Quicksort time distributions applets ungrid
- Rondomixed Quicksort time distributions applets ungrid
- Sorting comparison demos
- Distributional Convergence for the Number of Symbol Comparisons Used by QuickSort from JA Fill, Johns Hopkings U.
- Distributional Convergence for the Number of Symbol Comparisons Used by QuickSelect.from JA Fill, Johns Hopkings U.
X. Input Tuning - Sorting in Linear Time
- Lower bound for sorting
- Counting sort
- Radix sort
- Bucket sort
Resources
- CLRS II.8
- DVP Pg 63
- sortinginlineartime.pdf
- sortinginlineartime.zip
- https://visualgo.net/bn/sorting
- Lecture 5: Linear-time Sorting: Lower Bounds, Counting Sort, Radix Sort MIT Introduction to Algorithms (SMA 5503) Fall 2005
X. Some Examples of Algorithms Applications and Hard Algorithmic Problems
- Graph Algorithms
- Hard Algorithmic Problems
- TSP - Orion UPS
- Graph Isomorphism
- SAT
- NP (complexity) https://en.wikipedia.org/wiki/NP_(complexity)
- NP-hardness https://en.wikipedia.org/wiki/NP-hardness
- NP-complete problems https://en.wikipedia.org/wiki/NP-completeness
- P versus NP https://en.wikipedia.org/wiki/P_versus_NP_problem
- Stephan Ceroi´s lectures (in Spanish), ceroi@lirmm.fr in Calculability and Complexity
- String Processing Algorithms
- Information Retrieval
- Personalized Medicine
- 10 most influential algorithms in science and engineering of the 20th century
Resources
- Udacity CS215 Intro to Algorithms
- Coursera Algorithms on Graphs
- OM in the News: At UPS, the Algorithm is the Truck Driver Feb. 24, 2015 tags: algorithms, ORION, routing, scheduling, travelling salesman, UPS by Barry Render OM Blog
- At UPS, the Algorithm Is the Driver, Steven Rosenbush and Laura Stevens, WSJ, Feb. 16, 2015 8:28 p.m. (local)
- A Quasipolynomial Time Algorithm for Graph Isomorphism: The Details Math ∩ Programming jeremykun.com
- The international SAT Competitions http://www.satcompetition.org/
- Prizes Aside, the P-NP Puzzler Has Consequences nytimes.com
- Coursera Algorithms on Strings
- Vishal Sikka: The beauty and power of algorithms TED Talk
- Pratik Shah: How AI is making it easier to diagnose disease TED Talk
- Chinese scientists are creating CRISPR babies Antonio Regalado November 25, 2018 technologyreview.com
- The Algorithm for Precision Medicine youtube.com
- Top Ten Algorithms algorithms having "the greatest influence on the development and practice of science and engineering in the 20th century" nominated by the journal Computing in Science and Engineering February 2000
X. String algorithms and bioinformatics
Luis Fernando Niño
Resources
Report abuse