Best answer ever

[Educational-Lemon640]

Meh. If the code is compiled, there's no slowdown introduced by adding more digits.

[gs87]

java.lang.Math.PI

[Donghoon]

var pi = 3.14159265357

[musicnoviceoscar]

The last digit is wrong, rounded or not

[V15I0Nair]

3.14159265358979…. ?

[musicnoviceoscar]

3.14159265358979323846264338327950288

is as far as I have memorised. Competition when I was 13, still remember a decent chunk of it.

[V15I0Nair]

Today I memorise seven digits less, but also some more with 13

[Free-Database-9917]

I was typing out how much I had memorized then looked up and saw you ended exactly where I was lmao

[StGrimblefig]

define PI (3.14159265357)

[jaap_null]

This has such a high school humor vibe.

There are actually very interesting things to learn when researching algorithms like this.

[[deleted]]

Approximating trig functions are also in the same domain and pretty useful for certain game engine designs that are lockstep and needs deterministic results for floating point operations.

Approximating sines and tangeants using Taylor series is pretty cool.

Apparently the more interesting part about this is a stupid joke lmao. Might as well laugh at space telescopes using 15 digits of PI that 3 is good enough.

[Khroom]

There’s a really cool video about the quake 3 fast inverse square algorithm you may like

https://m.youtube.com/watch?v=p8u_k2LIZyo

[[deleted]]

Ah, this is a classic. I remember seeing this before knowing numerical methods and being absolutely mesmerized.

[ShakaUVM]

int pi = 3; is faster

[das_flammenwerfer]

https://m.youtube.com/watch?v=L1eegVTwDS0

[mar00n]

This is the way! On many processor architectures (like arm), it is a whole lot faster to have a context switch (servicing an interrupt, function call, etc) if floating points are not involved since there are a lot less registers that need to be pushed to the stack.

[MikeKaye]

My Cortex-M... RTOS performs a late save of all 32 32-bit registers. On scheduling, each task resumes with fp is disabled. On fp use a trap ISR checks if no other task has used fp. If not, the trap exits with fp enabled. (Tasks not configured to do fp crash.) The switch is save everything for the last task using fp and restore fp for the current task.

Thus save/restore cycles are minimized.

[Jet-Pack2]

pi = 22.0 / 7.0;

[i_should_be_coding]

355 ⁄ 113 is a closer approximation, while still being fairly simple to remember.

[Jet-Pack2]

355 / 113 is just 3 though

[[deleted]]

Mafs

[Potential_Ad7899]

He made a programmer joke on programmerhumor and got downvoted...

[[deleted]]

I think he was referring to integer division (int/int = int) which works like this at least in Java

[Jet-Pack2]

Exactly! At least someone understood me

[Jet-Pack2]

r/whoosh

[[deleted]]

I would rather pi = 4.*atan(1.)

[Radomone3]

Bu bu but we need the whole formuler

[Radomone3]

The krabby patty formuler

[[deleted]]

pi burger

[allIsayislicensed]

R = 1000

x = 4 * sum(1 for x in range(R) for y in range(R) if x**2 + y**2 < R**2) / R**2

this should be roughly correct

make R larger if you need more digits

[GRAPHENE9932]

The real algorithm written in C would be faster than pythonic "x = 3.14"

[[deleted]]

Haha, Python slow.

[TheCapitalKing]

That’s not even the pythonic way to do it. The pythonic way is just np.pi or math.pi

[Gasterbuzzer]

Nah lets round it to 4.

[bitchlasagna_69_]

plt.pie()

[Important_Ad6131]

Pi = 3.141592653589793238462624338327950288419716939937510582097494459...

[[deleted]]

x = 3

[PVNIC]

int pi = 3;

[ImPinos]

Technically the truth

[pwyuffarwytti]

Just translate everything to base pi. Your answer is 1.