For “what task should I do next,” it’s O(n), because you just go down the list once doing a pairwise comparison. “What task should I do next” seems more important for actually doing things than sorting the entire list at first to avoid deliberation time / indecision / harder 3-way value comparisons.
For “what task should I do next,” it’s O(n), because you just go down the list once doing a pairwise comparison. “What task should I do next” seems more important for actually doing things than sorting the entire list at first to avoid deliberation time / indecision / harder 3-way value comparisons.
Right, for a single pass it’s a find-the-maximum-element algorithm in O(n).
I think if you eventually do every task on the list it’s equivalent to sorting the list? But this basically never happens to me.
Presumably intermediate states (doing e.g. half the items) is of intermediate efficiency? But my grasp of the underlying theory here is pretty weak.