Possible Assumption:
Sorting has complexity O(n log n) but repeated sorting can be avoided with a better data structure
Manual sorting and counting of 4 million London Underground tickets in 1939 to analyse train use across the network.