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.
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.