CS people what do you call // ?

[futurebird@sauropods.win]

@yonder @ehproque

importing math feels very goofy. I should write a square root finder to avoid that. How do those go? It's like newton's method I think.

[futurebird@sauropods.win]

@yonder @ehproque

And now that I think about it, we don't need random either, just make it an grid, if it's fine enough it should be OK, right?

[darkling@mstdn.social]

@futurebird @yonder @ehproque Newton's method converges wonderfully quickly, so it's often a good place to start. I believe that CORDIC algorithms can also do square roots (although I haven't seen or derived one myself) -- those can be nicer for implementation if you don't have an FPU (or are building one), because they tend to be all about adds and bit-shifts and not much else.

CORDIC only generates one digit per iteration, though, whereas Newton doubles the precision each time.

[burnitdown@beige.party]

@ehproque @futurebird i need more pi

[gbargoud@masto.nyc]

@yonder @ehproque @futurebird

Can random.random() be stuck in a constexpr to do that at compile time or did someone rightfully shoot down the idea of compile time nonsererminism?

[ehproque@neopaquita.es]

@burnitdown @futurebird I'm out, but here's some cake

[futurebird@sauropods.win]

We don't need any random numbers to be THIS terrible.

inside=0.0
resolution=100
for x in range(resolution):
x=x/resolution
for y in range(resolution):
y=y/resolution

if x*x+y*y<1:
inside+=1

pi=4*inside/(resolution*resolution)

print(pi)

[c0dec0dec0de@hachyderm.io]

@llewelly @futurebird floor can also be defined as going toward zero.

Programmers are amazing at not knowing the foundations of things. I worked somewhere that was absolutely confounded by numpy’s use of statistical rounding (x.50 goes to the even value not up, to avoid biasing your data in a systematic manner). I, freshly graduated from college and having taken a stats course, knew what it was immediately.

[c0dec0dec0de@hachyderm.io]

I’m not pointing the “programmers […] not knowing […] things” at you specifically, @llewelly . That’s intended to be a completely separate thought. I’ve got blind spots large enough to park an aircraft carrier in, I’m sure.
@futurebird

[itgrrl@infosec.exchange]

@khleedril @ehproque @futurebird

[daniel@social.treehouse.systems]

@futurebird you're comparing to 1 so you don't even need root here

[futurebird@sauropods.win]

@daniel

OMG

You know, when I started writing this I had that in mind and just forgot about it... LMAO.

[llewelly@sauropods.win]

@c0dec0dec0de @futurebird imagine you descended to the basement of a strange building, and suddenly found yourself stuck to the ceiling. Such is the world of programming when not everyone agrees on the meaning of floor() ... *sigh*

[retreival9096@hachyderm.io]

@llewelly @c0dec0dec0de @futurebird coming from math, I have to ask: who is doing floor that way?

[oblomov@sociale.network]

@futurebird integer divide. Floor divide may or may not be appropriate for negative operands depending on how it is defined.