- 1 requires no sorting and is 25% faster than 2
  (sorting requires adding each row to a list, then copying the list to a vector of pointers, and then qsorting the vector)
- 2,3,4 are basically equivalent

Conclusion:
multiple column sorting has almost no overhead, but sorting has a 25% hit (for this use-case)