Programming

17313 readers

217 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

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

[email protected]

Suggest me a book on algorithms (lemmy.ml)

submitted 1 month ago by [email protected] to c/[email protected]

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

[–] [email protected] 3 points 1 month ago

There are plenty of good resources online. Here are some topics you probably wouldn't see in an intro algos course (which I've actually used in my career). And I highly recommend finding the motivation for each of these in application rather than just learning them abstractly.

bloom filter
btree
b+ tree
consensus algos (PAXOS, RAFT, VSR, etc)
error correction codes (Hamming, Reed Solomon, etc)
garbage collection (mark+sweep, generational, etc)
generational arena allocator
lease (i.e. distributed lock)
log-structured merge trees
min-cost + max-flow
request caching and coalescing
reservoir sampling
spatial partition (BVH, kd-tree, etc)
trie
write-ahead log