izard (izard) wrote,
izard
izard

O(n^3)!

Here is the code for the previous post

I should have wrote this code in the first place, took me only 5 minutes anyway. [personal profile] spamsink was right: apparently in runs in slightly below O(n^2).

But my proof of O(n^3) still stands, and I found a German university computer science textbook that also proves it should be O(n^3) in the worst case... Riddles!
Tags: software
Subscribe
  • Post a new comment

    Error

    default userpic

    Your reply will be screened

    When you submit the form an invisible reCAPTCHA check will be performed.
    You must follow the Privacy Policy and Google Terms of use.
  • 8 comments