Stable sorting

Implement a stable sorting algorithm, so that, e.g, sorting by checked-first after sorting alphabetically ends up with a list of unchecked items in alphabetical order, followed by checked items in alphabetical order. Currently, ordering of equivalent items is not preserved.


Mmm, I also like when sorting works like this

@Shida: what do you think of this?