brianstorti / elixir-exercism Goto Github PK

The binary search is implemented with linked lists. While I understand that this is an exercise, for the sake of example, I'd sort the list and then make a tuple if a tuple isn't provided. You can then use elem to retrieve the value at the index location with constant time access giving the solution logarithmic runtime complexity (+sort's linearithmic if you sort).

We were doing some excercises and were trying to figure out how to get constant time access to an "array" and this was the solution (using a tuple for constant time access)

There is an example over here: http://rosettacode.org/wiki/Binary_search