Hi Mike,
> Today I was wonder is it possible to create a function for binary search
> inside flatten or nested lists.
> If I have ordered list I need something faster that O(n) and I should not
> care of unique structure.
> It was a goal while walking in the forest.
You can do
hi all,
Today I was wonder is it possible to create a function for binary search
inside flatten or nested lists.
If I have ordered list I need something faster that O(n) and I should not
care of unique structure.
It was a goal while walking in the forest.
There is my code in repo:
https://goo.gl
lists, even though they are often
implemented in this manner.
Sincerely
*freeemint_*
2016-01-17 20:13 GMT+01:00 Mike Pechkin <mike.pech...@gmail.com>:
> hi all,
>
> Today I was wonder is it possible to create a function for binary search
> inside flatten or nested lists.
> I
