HNGlance

Top Best New Show

Ask HN: What's Your Favorite Algorithm?

https://news.ycombinator.com/item?id=33558115

by highwayman47 • 4 years ago

4 5 4 years ago

NE

news.ycombinator.com

Related Stories

Loading related stories...

Comments

5

john_the_writer• 4 years ago

I have loved this one for years

while (s++ = t++);

Rounin• 4 years ago

Binary search and similar forms of successive approximation. It can be used to solve such a wide array of problems given just a minimal amount of information.

highwayman47• 4 years ago

can you please ELI5?

graderjs• 4 years ago

I’m partial to LZ77 so simple and elegant and skiplist: simple but powerful

tothrowaway• 4 years ago

The Hungarian algorithm. It solves the assignment problem (the optimal way to assign workers to tasks given their completion time of each task). The assignment problem looks hopelessly O(n!), but by some magic, the algorithm can solve it in polynomial time.

Source preview

news.ycombinator.com

HNGlance

© 2024-2026 HN Glance. Story content belongs to its original sources.

Privacy
Terms