I don’t think it’s fast. The any-base one that NancyLebovitz linked to claims to be O((n log n)^3). The original hex one, I don’t know exactly but from the description on wikipedia it’s definitely worse than O(n) (I’d guess significantly worse).
oh, yea then it’s probably useless.
I don’t think it’s fast. The any-base one that NancyLebovitz linked to claims to be O((n log n)^3). The original hex one, I don’t know exactly but from the description on wikipedia it’s definitely worse than O(n) (I’d guess significantly worse).
oh, yea then it’s probably useless.