...but then the algorithmic complexity goes from O(N) to O(N^2), or at least O(N... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		fjkdlsjflkds on March 6, 2024 \| parent \| context \| favorite \| on: How to generate uniformly random points on n-spher... ...but then the algorithmic complexity goes from O(N) to O(N^2), or at least O(N log N), since points have to interact with each other. (N denotes the number of points you need to generate)

alanbernstein on March 6, 2024 [–]

I confess I've never used this in a situation where time complexity was at all relevant. For one thing, it is possible that a result only needs to be computed once for each N (and per shape, since this approach works on a wider range of shapes than just spheres).

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact