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!

Profile

izard: (Default)
izard

September 2017

S M T W T F S
     12
3456 789
10111213141516
1718 1920212223
24252627282930

Most Popular Tags

Style Credit

Expand Cut Tags

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