X[n+1]=1/2(X[n]+a/X[n]) 要求前后两次求出的得差的绝对值少于0.00001。 输出保留3位小数(The algorithm X[n+1]=1/2(X[n]+a/X[n]) is used to approximate the square root of a number 'a' using the Newton-Raphson method. The requirement is that the absolute difference between consecutive approximations is less than 0.00001. )
active 2023-11-12 → 2025-02-16 (UTC)
Activity over time
Daily event counts in the loaded window
Line chart, 463 days from 2023-11-12 to 2025-02-16. Pushes: 2 total, peak 2 in a day. Pull requests: 0 total, peak 0 in a day. Issues: 0 total, peak 0 in a day. Comments: 0 total, peak 0 in a day. Stars: 1 total, peak 1 in a day.
- Pushes
- Pull requests
- Issues
- Comments
- Stars
Top contributors
Pushes, PRs, issues, reviews and comments — stars and forks excluded, so this is contribution rather than popularity
| Contributor | Contributions | Pushes | PRs | Comments |
|---|---|---|---|---|
| NorthBlueSky | 2 | 2 | 0 | 0 |
Recent activity
Latest issues, pull requests and releases
No issue or PR events — this repo's activity is pushes only.
Totals cover only the window loaded into ClickHouse and count events, not GitHub's lifetime totals — 1 stars here means stars gained during the window, not the repo's star count.