undefined | Better HN

0 pointssolarmist4y ago0 comments

This is what big O (also little O and little omega) notation is all about. Unfortunately, all the resources I know of teach it as pure mathematics, so they require a firm grasp of mathematical proofs to understand the details and implications.

With that said I highly recommend the classic Introduction to Algorithms (CLRS for short) by Cormen et Al. It is written in clear and straightforward language. And the lectures on MIT OCW by Erik Demaine are outstanding.

By reading and watching the lectures I deeply understood stuff that I had just muddled through previously.

https://en.m.wikipedia.org/wiki/Introduction_to_Algorithms

0 comments

voakbasda4y ago

Introduction to Algorithms is a classic that every serious programmer should read cover to cover.

at my first programming job (now almost 30 years ago), I remember implementing the red-black tree algorithms in C from that book. It is chock full of really useful ideas that will make your systems better.

j / k navigate · click thread line to collapse

0 comments

voakbasda4y ago

Introduction to Algorithms is a classic that every serious programmer should read cover to cover.

j / k navigate · click thread line to collapse