O(n^3)!

Apr. 20th, 2017 09:59 am
izard: (Default)
[personal profile] izard
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!
From:
Anonymous( )Anonymous This account has disabled anonymous posting.
OpenID( )OpenID You can comment on this post while signed in with an account from many other sites, once you have confirmed your email address. Sign in using OpenID.
User
Account name:
Password:
If you don't have an account you can create one now.
Subject:
HTML doesn't work in the subject.

Message:

 
Notice: This account is set to log the IP addresses of everyone who comments.
Links will be displayed as unclickable URLs to help prevent spam.

Profile

izard: (Default)
izard

July 2017

S M T W T F S
      1
2345 678
910 11 12131415
16 171819202122
23 242526272829
3031     

Most Popular Tags

Style Credit

Expand Cut Tags

No cut tags
Page generated Jul. 25th, 2017 12:27 am
Powered by Dreamwidth Studios