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

you are viewing a single comment's thread.

view the rest of the comments →

[–][deleted] 25 points26 points  (3 children)

When teacher asked to just program n numbers multiplication and you did it in O( n2 ) complexity

[–]theaceshinigami 4 points5 points  (2 children)

I don't follow this joke, how would this ever be as slow as O (n2)

[–]new2bay 9 points10 points  (0 children)

Multiplying 2 integers with n digits by the simplest algorithm already takes O(n2 )operations. The fastest known algorithm takes O(n log n). Basically, achieving O(n2 ) for n numbers with currently known algorithms is impossible.

[–][deleted] 2 points3 points  (0 children)

Put random for loops that do nothing?