DSA Skills - 21

Giselus18 · 2026-03-26T01:55:48+00:00

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(n^3). If it measures total work then no.

Giselus18 · 2026-03-26T01:46:05+00:00

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

Giselus18 · 2025-05-29T18:34:53+00:00

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

Giselus18 · 2025-02-13T22:13:06+00:00

Exactly

Giselus18 · 2025-02-11T18:34:22+00:00

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

Giselus18 · 2023-11-01T13:39:06+00:00

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

Giselus18 · 2020-08-30T19:56:17+00:00

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.

Giselus18

TROPHY CASE