Explore >> Select a destination
|
You are here 
|
walkingrandomly.com | ||
| | | | |
www.karlrupp.net
|
|
| | | | | ||
| | | | |
www.johndcook.com
|
|
| | | | | Notes on math and software: probability, approximations, special functions, regular expressions, Python, C++, R, etc. | |
| | | | |
nla-group.org
|
|
| | | | | by Sven Hammarling and Nick Higham It is often thought that Jim Wilkinson developed backward error analysis because of his early involvement in solving systems of linear equations. In his 1970 Turing lecture [5] he described an experience, during world war II at the Armament Research Department, of solving a system of twelve linear equations | |
| | | | |
mfbmina.dev
|
|
| | | One of my favorite features in Go is the possibility of writing benchmark tests. At Go 1.24, this feature has a new look, making it easier to use. To demonstrate these changes, let's suppose a function that calculates the factorial recursively and one that calculates it through loops. func FatorialRecursive(n int) int { if n == 0 { return 1 } return n * FatorialRecursive(n-1) } func FatorialLoop(n int) int { aux := 1 for i := 1; i <= n; i++ { aux *= i } return aux } Previously, to write a benchmark, it was necessary to write down the whole execution loop of the test. When done, we need to run the command $ go test -bench . | ||
