Hacker News new | ask | show | jobs
by seanalltogether 3351 days ago
"Finally, the above code is less optimizable; absent compiler heroics, it will have O(n) time complexity, even though the underlying problem is often O(1)."

Is this addressed with pattern matching?