« first day (1 day earlier)  last day (15 days later) » 

jimmy23013
jimmy23013
04:44
@mbomb007 Seemed to be O(n^2) to me. More exactly, O(m) + O(m*k*(m-k+1)), but m-k=0.
@mbomb007 Never mind, I misunderstood that code. Yes, O(n^3)
@mbomb007 Nevermind, I misunderstood that code. Yes, O(n^3)
Ah, some network problem
 
8 hours later…
mbomb007
mbomb007
13:19
@applejacks01 Strings are actually Char[] (arrays of characters)
 
1 hour later…
applejacks01
applejacks01
14:39
Ok. Yeah sorry for the trouble. I always just took the Big O for an algorithm for granted, without realizing that it also depends on the type of data you are working with. Since strings are basically char arrays, they're going to have more complexity than other data types, like integers. Thanks for showing me how I was wrong

« first day (1 day earlier)  last day (15 days later) »