An introduction to lockless algorithms
An introduction to lockless algorithms
Posted Feb 22, 2021 9:49 UTC (Mon) by ballombe (subscriber, #9523)In reply to: An introduction to lockless algorithms by pebolle
Parent article: An introduction to lockless algorithms
To compute fibo(50) the naive sequential algorithm needs 50 additions, the naive recursive algorithm needs
12586269025 additions. That is what I call 'not working'.
12586269025 additions. That is what I call 'not working'.
Posted Feb 22, 2021 10:04 UTC (Mon)
by pebolle (guest, #35204)
[Link]
An introduction to lockless algorithms
I'll file this under 'Disagreeing what "work" means' too.