this post was submitted on 26 Sep 2024
43 points (97.8% liked)

Programming

17511 readers
104 users here now

Welcome to the main community in programming.dev! Feel free to post anything relating to programming here!

Cross posting is strongly encouraged in the instance. If you feel your post or another person's post makes sense in another community cross post into it.

Hope you enjoy the instance!

Rules

Rules

  • Follow the programming.dev instance rules
  • Keep content related to programming in some way
  • If you're posting long videos try to add in some form of tldr for those who don't want to watch videos

Wormhole

Follow the wormhole through a path of communities [email protected]

founded 1 year ago
MODERATORS
snowe
Ategon
[email protected]
43
Suggest me a book on algorithms (lemmy.ml)
submitted 2 months ago by [email protected] to c/programming
15 comments fedilink hide all child comments
 

I am a fresh software engineering graduate and I am looking for something to improve my problem solving skills, while I did learn about basic algorithms and data structures, I feel like I could learn further more, I know about big O, fast sorting algorithms, dynamic programming, backtracking, binary trees (Although I do not think I know everything about them), I also know about low level memory concepts.

I am sure I forgot to mention some of the stuff I also know about, but I hope the ones I mentioned give a good insights on where I should move onto next.

you are viewing a single comment's thread
view the rest of the comments
[โ€“] jonc211 13 points 2 months ago (2 children)

https://mitpress.mit.edu/9780262046305/introduction-to-algorithms/

This one is pretty hardcore. I bought the 2nd edition of it over 20 years ago when I started my career as a developer due to not doing a CS degree.

[โ€“] NostraDavid 3 points 1 month ago* (last edited 1 month ago)

There are YT courses available to support the book. Or rather, the book exists to support the courses:

Don't mind the ages of these series - I watched them in full, and they're generally still relevant. I say generally because I'm not sure if I'll ever use a Tango Tree, but who knows!

PS: If you're not sure if you don't know the required Math, I created a graph of all MIT courses with YT videos here. The courses on the left are dependencies for those to the right.

load more comments (1 replies)