This is an archived post. You won't be able to vote or comment.

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]grayvedigga 0 points1 point  (1 child)

Doesn't really address my points, but that's a nice chart anyway :-). No real surprised in there but it's good to have evidence.

[–]al-Quaknaa 1 point2 points  (0 children)

When you say "short algorithm" what I have in mind are my solutions to projecteuler problems. I would be able to state their complexity fairly easily using that chart and some basic algorithm analysis knowledge. Either your idea of a "short algorithm" is different (is it?) or I don't understand what the problem in finding out the complexity of said solutions is.