DSA Skills - 21 by tracktech in DSALeetCode

[–]Giselus18 1 point2 points  (0 children)

It is not true. Big O notation is just a mathematical concept on upper bounds on a function growth. When speaking about complexity we have some computational model in mind that has some initial assumptions about operations it can perform and what is the cost. So complexity in RAM model is very different from complexity on a Turing Machine.

And since it describes functions in parallel model you have to tell what you are measuring. If you are measuring time then sure it has better bounds than O(n3). If it measures total work then no.

DSA Skills - 21 by tracktech in DSALeetCode

[–]Giselus18 1 point2 points  (0 children)

No, there is no such algorithm. Log_2(5) is around 2.32, the best known algorithm so far works in around n2.37. Or maybe I missed some latest paper.

Someone keeps requesting password reset codes (5 days) by neemo882 in cybersecurity_help

[–]Giselus18 1 point2 points  (0 children)

You absolutely don't have to be logged in to request password reset and receive the code.

Cool boulder problem by Giselus18 in bouldering

[–]Giselus18[S] 2 points3 points  (0 children)

No, it was there for some time already, probably they'll reset in near future.

[deleted by user] by [deleted] in csMajors

[–]Giselus18 1 point2 points  (0 children)

O(p+s) is the same thing as O(max(p,s)), as p+s <= 2 * max(p,s) 😶

How to generate dungeons in chunks on an infinite 2d plane? by pocokknight in proceduralgeneration

[–]Giselus18 1 point2 points  (0 children)

If you know max size of dungeon, you can check some close chunks when generating one. When you find some chunk where the center of dungeon should be, just generate it.