@semiotechnic Can probably skip the ordering: step through the series, creating a set of bins on the fly?
@semiotechnic like, for [1, 1, 5, 1, 2, 5, ...] your bin list would look like [(1,1)] then [(1,2)] then [(1,2),(5,1)], [(1,3),(5,1)]...
-
-
@semiotechnic in English: one one, two ones, two ones one five, three ones one five... -
@semiotechnic I Am Not A Programmer but that seems o(N) and I doubt there is any way to do it in less than o(N).
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.
. Banned in Sweden. SubGenius, Zhuangist, white-hat troll. Defrocked mathematician. Brain problems.