Chronosort is closer to radix sort, as both are O(n) if values are bounded. Queue-sort (aka heapsort) is O(n log n).