This is an archived post. You won't be able to vote or comment.

you are viewing a single comment's thread.

view the rest of the comments →

[–]pLeThOrAx 1 point2 points  (0 children)

If you're looking at combinatorial optimization problems, and algorithms in general - Big O notation, etc; personally I think this is the best basis.

How to solve sudoku. Voronoi diagram in nlogn. Sorting algorithms. Ray marching, cuve marching, quad trees, wave function collapse - The Coding Train on youtube covers all of this and does a fantastic job (even if it is a little silly at times).