The example problem (essentially, is T a subsequence of S with deletions of size N) is a classic problem with no doubt dozens of implementations in AlphaCode's training set. And yet, what a garbage solution it produces. To illustrate the difference between intelligence and regurgitation, someone tell me what CoPilot generates for this: // A Go function to swap the sixth bit and seventeenth bit of a 32-bit signed inte…
Ask and you shall receive, here is the output it gave me: // Write a Go function to swap the sixth bit and seventeenth bit of a 32-bit signed integer. package main import ( "fmt" "math" ) func main() { var a int32 = 0b1010101010101010101010101010101010101010101010101010101010101010 fmt.Printf("%b\n", a) fmt.Printf("%b\n", swapBits(a, 6, 17)) } func swapBits(a int32, i int, j int) int32 { // convert to binary bin := f…