Big-O Time Complexities of Elixir Data Structures

Oh this is a nice initiative :+1:
Although it doesn’t mention the complexities explicitly, this article comparing sequences might be an interesting resource to mention as well.

This one would actually be O(log n), since erlang’s :arrays are tries (like maps), not actual arrays in the traditional imperative programming sense.