Re:Ask HN: How to learn algorithms and become a good program...
by rajeshmr on Monday August 17, 2015 @11:08PM
(#10077417)
Hey thanks for your suggestions! I have started learning algorithms multiple times and dropped it mid way since either i find it intimidating or i am stuck and i can't find help. I am giving this another shot. Hopefully i make it.
The thing is is that merge-sort was discovered by John von Neumann [1] and QuickSort by CAR Hoare [2]. The less accomplished of the two won a Turing Award and one might quite legitimately walk away with the belief that developing algorithms from scratch may be non-trivial simply because the subject is really hard.
Which is a round about way of coming to some advice: if the very subject of algorithms isn't enough to scare you off, don't fret the fact that the presentation looks difficult. The apparent difficulty is in the subject itself and the only thing a gentle introduction or simplification means is that someone is pretending that the subject of algorithms is not really really hard with the natural consequence that when it does get hard, you're more likely to see the struggle as a failing of the student rather as inherent in the subject matter. And everything interesting and important in algorithms is hard.
This is why I don't hesitate to suggest people consider TAoCP. It covers the "easy" parts as well as or better than anything else I've seen. It just requires being ok with not understanding everything or even most things that Knuth covers because he finds them important and interesting. Because I'm never going to be that smart, I might as well work at my own pace, and celebrate the small victories like grasping the answer to one of the easy exercises that a year ago, I wouldn't have grasped.
The other recommendation is to take an algorithms course on Coursera. It's free.
Good luck.
[1]: https://en.wikipedia.org/wiki/John_von_Neumann
[2]: https://en.wikipedia.org/wiki/Tony_Hoare