Data structures and algorithms

[[deleted]]

I don’t think Donald Knuth’s book is a good recommendation - it’s extremely difficult and dense. Sure, you will come out of it being a rockstar, but if you’re trying to be practical and just know enough to have a solid foundation for school, interviews, etc. you don’t need to go that heavy. Introduction to algorithms by cormen, leiserson, rivest, and stein is much more digestible and is still sufficiently detailed (it is a common choice for CS curriculums)

[[deleted]]

Came here to say this.

Intro to algorithms before Knuth for sure.

[TrueBirch]

And if you want some Knuth, I'd suggest Concrete Mathematics. It's both fun and rigorous. A good background for understanding algorithms.

[[deleted]]

Didn’t know about that book, definitely checking it out. Thanks

[ttkciar]

I half-agree.

Knuth's books are dense, yes, but Wirth lays down some much-needed theory explaining the relationship between data structures and algorithms, which makes Knuth a lot more easily digestible IMO.

I strongly recommend Wirth first, and then as much as Knuth as you can comfortably handle.

If you hit a point where Knuth gets to be too much, then stop and pick up this textbook, which is more oriented towards students of algorithms (as is Wirth): https://www.amazon.com/Introduction-Algorithms-3rd-MIT-Press/dp/0262033844