Originally posted by: pillage2001
?????Originally posted by: gopunk
(N(N+1)(2N+1))/6
Originally posted by: Zakath15
Originally posted by: pillage2001
?????Originally posted by: gopunk
(N(N+1)(2N+1))/6
That's the solution to the summation.
Originally posted by: gopunk
yups
and for a data structures class, you should probably note that an algorithm with that order time complexity is O(n^3)
Originally posted by: oboeguy
Sounds right. Note that there's no "infinity" in the first post, it simply goes to "n". So the summation notation form should not use "n" as the index, tsk tsk.![]()
Originally posted by: AvesPKS
Originally posted by: oboeguy
Sounds right. Note that there's no "infinity" in the first post, it simply goes to "n". So the summation notation form should not use "n" as the index, tsk tsk.![]()
Damn...I've been up for 26 hours writing a polisci paper due at...45 minutes...