Explore >> Select a destination
|
You are here 
|
www.sebastiansylvan.com | ||
| | | | |
attractivechaos.wordpress.com
|
|
| | | | | Array and hash table are probably the most important data structures. Some programming languages such as Perl, Lua and Javascript, almost build the language core on top of the two data structures. While array is straightforward to implement, hash table is not. This is why we have paid continuous efforts in improving the hash table... | |
| | | | |
probablydance.com
|
|
| | | | | I had to get there eventually. I had a blog post called "I Wrote a Fast Hashtable" and another blog post called "I Wrote a Faster Hashtable." Now I finally wrote the fastest hashtable. And by that I mean that I have the fastest lookups of any hashtable I could find, while my inserts and | |
| | | | |
www.code-spot.co.za
|
|
| | | | | I finally laid my hands on Donald Knuth's The Art of Computer Programming (what a wonderful set of books!), and found a neat algorithm for generating random integers 0, 1, 2, ... , n - 1, with probab... | |
| | | | |
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 . | ||
