the-evolution-of-a-go-programmer icon indicating copy to clipboard operation
the-evolution-of-a-go-programmer copied to clipboard

Published 20 hours ago • verified publisher icon SuperPaintman

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

Open soitsmutiny opened this issue 5 years ago • 4 comments
trafficstars

soitsmutiny avatar Feb 10 '20 05:02 soitsmutiny

This would close #7

iamtakingiteasy avatar Feb 10 '20 11:02 iamtakingiteasy

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

tetafro avatar Feb 17 '20 07:02 tetafro

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.

iamtakingiteasy avatar Feb 17 '20 07:02 iamtakingiteasy

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

mizabrik avatar Feb 18 '20 07:02 mizabrik