Message-ID: <6MMMq4crJaB@09.viking.ruhr.com>
X-Gateway: ZCONNECT UU viking.ruhr.com [DUUCP BETA vom 06.11.1996]
References: <57j5dh$sh3$1@goanna.cs.rmit.edu.au> <6MIHn7irJaB@09.viking.ruhr.com> <01bbe2fb$c692d1c0$c761e426@DCorbit.solutionsiq.com>
From: roc@viking.ruhr.com (Rolf Czedzak)
Subject: Re: Mergesort: why's it efficient?
Date: 06 Dec 1996 00:00:00 +0000
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!oitnews.harvard.edu!purdue!lerc.nasa.gov!magnus.acs.ohio-state.edu!math.ohio-state.edu!howland.erols.net!blackbush.xlink.net!ins.net!viking.ruhr.com!roc
Newsgroups: comp.lang.c++,comp.sys.mac.programmer.help,comp.lang.lisp
Distribution: world
Lines: 21
Xref: glinda.oz.cs.cmu.edu comp.lang.c++:231816 comp.sys.mac.programmer.help:44626 comp.lang.lisp:24058

Dann Corbit  wrote:          <01bbe2fb$c692d1c0$c761e426@DCorbit.solutionsiq.com>

DC> Rolf Czedzak <roc@viking.ruhr.com> wrote in article
DC> <6MIHn7irJaB@09.viking.ruhr.com>...
DC> [mega-snip]
DC> > AK> Again: O(N log N) is almost as good as O(N).  It is not almost
DC> > AK> as good as O(1), and is much better than O(N^2).
DC> >
DC> > Its uncomparable. O(n) might easily be outscored by O(N^2) for all
DC> > practical problems.
DC> False.

Hi Dann,

I wrote 'uncomparable' and 'might'+'prcatical problems' in reply to
Andrew's statement about real life problems (= upper limints for N)
and comparability of O-Classes, which in fact are classifiers of
asymptotic behaviour.
What could be wrong with this?

Rolf
