search

LilyFoote / polydivisible

Search for polydivisible numbers using all nonzero digits exactly once.
0 stars 0 forks source link

Improve efficiency of search #3

Open LilyFoote opened 9 years ago

LilyFoote commented 9 years ago

Polydivisible.search is currently noticably slow for bases with high prime factors. This is because the search space for each digit is dependent on the gcd of the current divisor and the base.

An (efficient) way to reduce the search space would significantly improve performance.

The divisible method is the biggest bottleneck in the current algorithm so speedup here would have the next greatest impact.

LilyFoote commented 9 years ago

The divisible method was removed in 17ae968.