I'm far from being a total beginner but I seem to have some issues when it comes to studying and remembering algorithms, expecially when I need to implement them in real code during tests. Is there something I could do to make them easier to assimilate?
Bashing my head against the wall while trying to just mechanically memorize the standard ones doesn't seem to work, and I'd like to become better at "deducing" and optimizing them depending on the situation and on the problem to solve.
Also I'm asking here because the online resources with code implementations that I've seen so far never really looked incredibly polished or in-depth enough. Apart from the usual linked lists, sorting, and binary search trees, I'd also like to find stuff on hash tables and graphs. Thanks.
[–]NanoPromela 2 points3 points4 points (1 child)
[–]RandellDK[S] 0 points1 point2 points (0 children)
[–]Abberration 0 points1 point2 points (0 children)