self-adapt to fastest implementation using k-armed bandit

keep track internally which method works better for which array sizes, using the currently best known guess 70% off the time -> automatically decide for fastest implementation

@minuteman3 you're gonna love this
idea by @dominictarr

We could expose this as `intersect.smart()`, I haven't seen this module being used with variable sized input sets, but that's a very interesting experiment nevertheless.