Get the latest tech news
When Greedy Algorithms Can Be Faster [C++]
In the realm of computer science, we're always told to pursue what is the most efficient solution. This can be either what is the fastest way to solve a problem; or what may be the cheapest.
All points fall within the unit circle All look to be equally distributed No (theoretical) infinite looping No wasted random numbers I've worked in some environments (e.g. medical devices) where code was shipped with-O0 explicitly turned on as to ensure there no unexpected side effects from optimization. Coupled with that we have 4 procedure calls and at the end a check to see if we need to repeat the entire process (and remember there is 22% chance it could happen).
Or read this on Hacker News