Hi, I find this can be useful in selecting the collections and their manipulating functions to be used in our code.
The case is that in an immutable language it may not be evident what is the O(...) of the insert, read, update, delete and sort, in our collections. For example, what is the complexity of sorting an immutable enumerable via `Enum.sort`? I really do not know. This could be documented with a table at the start of the documentation for the collection. This effort could be decomposed in as many issues as the number of collections to document. Experienced people may know many of these Big-O details, but for newcommers to Elixir (and Erlang) it could be very helpful. Thanks Mário -- You received this message because you are subscribed to the Google Groups "elixir-lang-core" group. To unsubscribe from this group and stop receiving emails from it, send an email to elixir-lang-core+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/elixir-lang-core/a3f79568-10d3-49b0-a93f-a1bcf7054c59%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
