On Sun, Apr 20, 2008 at 6:50 AM, Per Jessen <per@xxxxxxxxxxxx> wrote: > Nathan Nobbe wrote: > > > umm, so whats going on here is the implicit component of the statement > > that incorporates relative or absolute performance. in terms of > > relative performance the statement is accurate; in terms of absolute > > performance, its quite inaccurate. > > > > Nathan, I think we're disagreeing about the meaning of "algorithm" - an > algorithm does not have an absolute performance until it's been > implemented - in some of other language and machine. > i thought about that too.. i looked it up on wikipedia before i posted just to be sure of myself. the way i view it, there are 2 things an algorithm could mean. there are for instance well known algorithms like bubble sort or quick sort, but basically any function written in any language is an algorithm. and wikipedia agrees w/ that statement. but either way i dont see why it matters, if you implement an algorithm (according to you) in c or php then at that point it will have an absolute performance. and the likelihood its faster in c, absolutely, is very very high :) -nathan
