一些Python模拟角谷猜想的性能测试

1
def solve(n):
2
    step = 0
3
    while n != 1:
4
        if n % 2 == 0:
5
            n //= 2
6
        else:
7
            n = 3 * n + 1
8
        step += 1
9
    return step
10
N = 1000000

1
x = [i for i in range(1, N + 1)]
2
y = list(map(solve, x))

1
from concurrent.futures import ThreadPoolExecutor
2
x = [i for i in range(1, N + 1)]
3
with ThreadPoolExecutor(max_workers=12) as e:
4
    y = list(e.map(solve, x))

1
import numpy as np
2
x = np.arange(1, N + 1, 1)
3
y = solve(x)

1
import numpy as np
2
x = np.arange(1, N + 1, 1)
3
solve_vector = np.vectorize(solve)
4
y = solve_vector(x)