4 ms·
It's almost as if you all sorted your own binary search tree of UPS packages.
by equalunique 9y ago
It's almost as if you all sorted your own binary search tree of UPS packages.
- halflings 9y agoEven better than that: a literal traveling salesman problem! At least building a binary search tree is O(n.log(n))... what they were solving is NP hard (for the optimal solution).