开发者

Efficiencies of set operations vs array operations in ruby

What are the differences in efficiencies between set and array for operations?

Examples:


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.

0

上一篇:

下一篇:

精彩评论

暂无评论...
验证码 换一张
取 消

最新问答

问答排行榜