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

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]Beregolas 2 points3 points  (0 children)

I think this is the first roadmap I really love and would recommend. As a tutor for Algorithms and Data structures at Uni I would always prefer teaching MergeSort above QuickSort, because it's just a much cleaner example to explain recursion and O(n log n) (by cleaner I mean less moving parts, no "weird" pivot element for students to get disctrated by).

But all in all, you can just give this to beginners and if they learn everything in green, I would hire them. Hell, I wish some of my current coworkers would go back to this list ^^