There is no sorting algorithm that is O(n log n) in time, O(1) in space and also stable. Pick your poison.
miniblog.
Related Posts
Date of birth pickers are a surprisingly nuanced UI problem.
What do you pick as the initial value? How do you allow users to easily move by large amounts (years) as well as small amounts (the exact day)?
Defaulting to today and even allowing future dates is funny though.
I have mixed feelings about the equality trait in Rust.
I have types where sometimes I want to compare by structure, and sometimes compare by reference.
I can only implement Eq for one, so which do I pick?
It's important to update your system regularly, to pick up security updates. This should ideally be automated.
But if you could only update one thing, I think it should probably your browser. It's exposed to data from a huge range of sources and regularly has nasty bugs.
