O(n) -> O(n-1)

[soitsmutiny]

No description provided.

[iamtakingiteasy]

This would close #7

[tetafro]

Also there's no such thing as O(n-1). It is still O(n).

[iamtakingiteasy]

If you mean complexity growth is linear, yes, it remains linear, but actual complexity is reduced from n cycles to n-1 cycles for any given n.

[mizabrik]

Also there's no such thing as O(n-1). It is still O(n).

Nope, there is. It's exactly the same thing as O(n).