I thought of a new shortest-path algorithm, want ot check it's big-O

[cirthix]

anyone know off-hand what the sum from k=1 to k=x of n^(1/k) is, in terms of big O?

 

[KLin]

Very appropriate

 

[compuwiz1]

Originally posted by: KLin
Very appropriate

That was very timely, as well as appropriate! :laugh:

 

[MmmSkyscraper]

I'm thinking I might take that new chick from Logistics. If things go well I might be showing her my O-face. "Oh... Oh... Oh!" You know what I'm talkin' about... "Oh!"

 

[cirthix]

http://en.wikipedia.org/wiki/Big_o_notation

 

[bunnyfubbles]

Big O?

 

[AbsoluteParadigm]

I think it's O(n) since the largest exponent of the sum is 1.

 

[MmmSkyscraper]

Originally posted by: AbsoluteParadigm
I think it's O(n) since the largest exponent of the sum is 1.

What he said cos it sounds clever.

 

[cirthix]

Originally posted by: AbsoluteParadigm
I think it's O(n) since the largest exponent of the sum is 1.

that does sound reasonable, thanks. but i think i'm going about finding the big o the wrong way . either that, or my algorithm really sucks, which it might

 

[MmmSkyscraper]

Originally posted by: cirthix
but i think i'm going about finding the big o the wrong way

ROFL, yeah I think the traditional method involves more bars, beer goggles and less posting maths questions on teh intarwebz