Robert Cummings wrote: > You are correct about asymptotic bounds on algorithms; however, > languages can still have a constant multiplier affect on an algorithm. Absolutely. When it comes to "how long does it take to process 1000 elements", both language and hardware are critical factors. But the algorithm efficiency remains constant. > Asymptotic bounds (Big Oh) are useful, but their applicability isn't > always universal. Some algorithms that are asymptotically inferior > actually perform better on small input sets than their asymptotic > superiors... I don't recall for certain, but bubblesort might be one > such example. Also true. Quick sort is such an example - in general it does really well, but for certain data sets, it doesn't. /Per Jessen, Zürich -- PHP General Mailing List (http://www.php.net/) To unsubscribe, visit: http://www.php.net/unsub.php
