What are the differences in efficiencies between set and array for operations?
Examples:
- lookups
- iterations
- includes?
可以将文章内容翻译成中文,广告屏蔽插件可能会导致该功能失效(如失效，请关闭广告屏蔽插件后再试):
问题:
回答1:
In Ruby, Set is written using an underlying Hash for its storage, and it should generally perform equivalent to a Hash. Thus:
include?: O(1) for Set, O(n) for Array- enumerations: O(n) for both
delete: O(1) for Set, O(n) for Array
...etc.
If by "lookups" you mean looking up by index, I'd note that the default Set implementation is unordered, so it doesn't support that operation in the same way an Array does.
