could you please input that into chatgpt so it will give me a summary of the code output? I'm a busy data driven guy so I don't have time for the details. however, I do have time for this post
Gotta dump results in some accumulate tho, and if then logic might be eh (although with branch prediction it might be auto 2 threads actually or similar utilization at least)
A reasonable compiler could optimize this into a bitwise AND, load the pointer to the appropriate string constant into a register branchlessly using a lookup table or cmov instruction, and then execute a single call to printf.
I mean if I want to know the precise number, like 40012 or whatever. Obviously single call is fast, but printf of 40000 strings single strings is meh. I mean in my variant I don’t run comparison, even bitwise, just 80000 rand and sum, single ceil and print
I'm guessing it literally is a few lines in R, plugging in the polling data after running it through a "model" (i.e. tinkering with the variables based on how polls have historically translated into votes)
![[Not the Onion] Simulations](https://hexbear.net/pictrs/image/eb31da58-12e6-442a-802a-bb751b72cecf.png){kind=link}
the simulation in question:
for (int i = 0; i < 80000; i++) { if (rand() % 2 == 0) { printf("Kamala wins\n"); } else { printf("Trump wins\n"); } }This is much cleaner than mine that I did in python.
thanks. Nate Silver paid me $50k to write this
could you please input that into chatgpt so it will give me a summary of the code output? I'm a busy data driven guy so I don't have time for the details. however, I do have time for this post
deleted by creator
huh, the sync for Lemmy code block renderer doesn't show the \ even within the code block 👁️👁️
Seems lots of unnecessary mods tbh,
S=0
for i in 1:80000
S+=rand()
end
ceil(S)
Modding by 2 is just a bitwise operation tho
Gotta dump results in some accumulate tho, and if then logic might be eh (although with branch prediction it might be auto 2 threads actually
or similar utilization at least)
A reasonable compiler could optimize this into a bitwise AND, load the pointer to the appropriate string constant into a register branchlessly using a lookup table or cmov instruction, and then execute a single call to printf.
I mean if I want to know the precise number, like 40012 or whatever. Obviously single call is fast, but printf of 40000 strings single strings is meh. I mean in my variant I don’t run comparison, even bitwise, just 80000 rand and sum, single ceil and print
I'm guessing it literally is a few lines in R, plugging in the polling data after running it through a "model" (i.e. tinkering with the variables based on how polls have historically translated into votes)