On 30/06/06, Anne & Lynn Wheeler <[EMAIL PROTECTED]> wrote:
Jim Mulder wrote:
> O(n) - searching a list of n elements
> O(n ** 2) - bubble sort of n elements
> O(n * log(n)) - heap sort of n elements
there are many cases of searching list of n elements ... which can
result in non-linear overhead increases. this typically happens when
the frequency of searching is possibly related to load, but the length
of the list can increase much faster than increase in processing (say a
queue).
Only you Lynn, could take a post on examples of Big Oh notation and
post the default time-out values for IP protocols. Are you on a
mission to have as many links to your website on this list as is
possible?
Go on, post something only tenuously related to a single word in this
post and add another 62 links to your usenet posts over the last 15
years.
--
Steve
Despair - It's always darkest just before it goes pitch black...
----------------------------------------------------------------------
For IBM-MAIN subscribe / signoff / archive access instructions,
send email to [EMAIL PROTECTED] with the message: GET IBM-MAIN INFO
Search the archives at http://bama.ua.edu/archives/ibm-main.html
