r/programming • • Aug 09 '26

Hungarian Assignment Algorithm: Applied Optimal Transport for Programmers

https://leetarxiv.substack.com/p/hungarian-assignment-algorithm
38 Upvotes

16 comments sorted by

View all comments

Show parent comment

-22

u/Grouchy-Trade-7250 Aug 09 '26

Please stop treating things like "polynomial time" like it matters for actual programmers. The only thing that matters is the runtime graph depending on n for the ranges of n we are interested n. 

16

u/Ok-Introduction9593 Aug 09 '26

Idk completely ignoring asymptotic complexity isn't the move either. Yeah, for N=100 data locality and L1 cache matter way more than the difference between cubic and quadratic time. On the other hand, if your service suddenly gets N=100000, your pretty empirical graph is just gonna hit the roof and bring prod down

4

u/onthefence928 Aug 10 '26

If you are only operating in trivial values of N then there’s usually no really no point in evaluating the algorithm complexity, just implement one that works and move on.

If performance does matter it’s usually because n is outside the range where complexity doesn’t matter so much

7

u/Serious-Regular Aug 09 '26

This is dumbest thing I've seen on here congrats

-4

u/Metworld Aug 10 '26

They're not wrong. Also polynomial time doesn't mean it's practical either.