Just a compilattion of scripts in various programming languages intended to calculate aproximations of pi.
Time Complexity O(N * logN * loglogN), where:
N = number of iterations
Division of two numbers of order O(N) takes O(logN loglogN) time.
| Name | Name | Last commit date | ||
|---|---|---|---|---|
Just a compilattion of scripts in various programming languages intended to calculate aproximations of pi.
Time Complexity O(N * logN * loglogN), where:
N = number of iterations
Division of two numbers of order O(N) takes O(logN loglogN) time.