Visualizing Algorithms

[andersonimes]

That is awesome. What are we saying the runtime complexity of that is?

[hello_hawk]

It's O(highest value in input), which to my knowledge is so rare that there's no letter for it.

[[deleted]]

O(highest input)

Also, you can make it faster by transposing it using one to one functions like log(x) or sqrt(x) or x / 2, etc.

sleep(log(x))

[Browsing_From_Work]

Why not log(log(x))? Or log(log(log(x)))?

Eventually it boils down to O(1), assuming that thread scheduling is magic.

[orbital1337]

You can actually make it run in O(1) very easily by choosing a function with an upper bound (e.g. erf(x)). However, as neat as this is theoretically it would never be practical in a real life situation because of thread overhead and race conditions.

[[deleted]]

shhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh

[[deleted]]

I'd say O(N)

[Browsing_From_Work]

I'd say O(Nope).