And OSs either use a simple list for the timer queue (which means n^2 overall complexity), or something based on a heap (like a binary tree), which ultimately becomes O(n lg n).