You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
While this is a reasonable implementation strategy to get O(1), it makes the algorithm a lot harder to read. We should get the index of the item in the list instead when it comes time to compare. That will require defining index in Infra, but that seems like a good thing to be doing regardless.
While this is a reasonable implementation strategy to get O(1), it makes the algorithm a lot harder to read. We should get the index of the item in the list instead when it comes time to compare. That will require defining index in Infra, but that seems like a good thing to be doing regardless.
Yeah, I see your point. As long as the net effect is the same (and using a map is ok for implementations), I'm ok changing the spec to make it easier to read.
While this is a reasonable implementation strategy to get O(1), it makes the algorithm a lot harder to read. We should get the index of the item in the list instead when it comes time to compare. That will require defining index in Infra, but that seems like a good thing to be doing regardless.
cc @mfreed7 @josepharhar @domenic
The text was updated successfully, but these errors were encountered: