mirrors/coding-interview-university
mirrors
/
coding-interview-university
mirror of https://github.com/jwasham/coding-interview-university.git
1
0
Fork 0
Code Issues Projects Releases Wiki Activity

Merge pull request #76 from elliptica/master 

Fix typo
This commit is contained in:
John Washam 2016-12-20 09:40:46 -08:00 committed by GitHub
parent d13ce66d13 85f99454e5
commit beaec7e567
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
README.md
View File

@ -1044,7 +1044,7 @@ You'll get more graph practice in Skiena's book (see Books section below) and th
- [ ] [Complexity: P, NP, NP-completeness, Reductions (video)](https://www.youtube.com/watch?v=eHZifpgyH_4&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=22)
- [ ] [Complexity: Approximation Algorithms (video)](https://www.youtube.com/watch?v=MEz1J9wY2iM&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=24)
- [ ] [Complexity: Fixed-Parameter Algorithms (video)](https://www.youtube.com/watch?v=4q-jmGrmxKs&index=25&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp)
- Peter Norvik discusses near-optimal solutions to traveling salesman problem:
- Peter Norvig discusses near-optimal solutions to traveling salesman problem:
- [Jupyter Notebook](http://nbviewer.jupyter.org/url/norvig.com/ipython/TSP.ipynb)
- Pages 1048 - 1140 in CLRS if you have it.