Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Because you're saving the O(N) time copy...

iirc, Ruby's array doesn't expose the distinction between length and capacity, but internally it may decide to amortize the cost of such copies. For example, if reject only removes a small % of elements, it may choose not to shrink capacity.



You're not saving the O(N) time copy, just replacing it with an O(N) slide.

(That's assuming you copy at all, instead of simply updating the reference.)


I meant O(N) space, as you said "That would still require O(n) space" - but a slide does not require additional space.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: