Re: [go-nuts] Re: 64 Tiny Algorithmic Puzzles in Go

shown here: >> https://go.dev/play/p/IDJP_iIsGDE >> >> On Sunday, March 3, 2024 at 1:42:51 AM UTC+8 BUGFIX 66 wrote: >> >>> https://BUGFIX-66.com >>> >>> Solve each puzzle by making a tiny change to a short piece of Go code. >>> Edited code

[go-nuts] 64 Tiny Algorithmic Puzzles in Go

https://BUGFIX-66.com Solve each puzzle by making a tiny change to a short piece of Go code. Edited code is compiled and tested on the host server. Each puzzle is a useful little algorithm or idea. Unfortunately, most users can't solve puzzle #3 and give up. Enjoy. -- You received this me

[go-nuts] Code to circumvent Go's memory safety (read/write arbitrary addresses without unsafe)

nsafe: https://bugfix-66.com/142fe84d7400a941ca0a1122096aaa300347e9180f567e373f21a1f2d0d22617 With today's Go runtime, if GOMAXPROCS equals 1, does that prevent this circumvention? -- You received this message because you are subscribed to the Google Groups "golang-nuts" group.

[go-nuts] BUGFIX-66: Algorithmic Puzzles in Go

Still under construction: https://BUGFIX-66.com Site is intended to be like the book Hacker's Delight, but as a game. Or like professional programming, where you're mostly trying to understand/modify other people's code. Or like programming in a post-GPT3 world where you'