This PR adds two benchmarks (sieve of Eratosthenes, removing duplicates from the list) and one test (a function with sublinear complexity defined via well-founded recursion evaluated on large naturals with up to `60` digits). The tests have been suggested by @b-mehta. |
||
|---|---|---|
| .. | ||
| dedup.lean | ||
| divisors.lean | ||
| leroy.lean | ||