From: Heutchy <Heutchy AT prodigy DOT net>
Newsgroups: comp.os.msdos.djgpp
Subject: Re: The meaning of O(n)...
Date: Fri, 23 Jan 1998 22:40:38 -0800
Organization: Prodigy Internet
Lines: 12
Message-ID: <34C98CE6.861@prodigy.net>
References: <Pine DOT GSO DOT 3 DOT 96 DOT 980120190605 DOT 19121B-100000 AT bert DOT eecs DOT uic DOT edu> <34C8B7D1 DOT A19B36EA AT pentek DOT com>
Reply-To: Heutchy AT prodigy DOT net
NNTP-Posting-Host: port97.seat3.prodigy.net
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
To: djgpp AT delorie DOT com
DJ-Gateway: from newsgroup comp.os.msdos.djgpp
Precedence: bulk

> 2^n, n!, n^3, n^2, nlog(n), n, log(n), 1.

At the risk of sounding like an idiot, isn't n! worse than 2^n?

n! = 1 * 2 * 3 * 4 * ... * n-1 * n
2^n = 2 * 2 * 2 * 2 * ... * 2 * 2

So the n! grows much faster.  n^n would be worse however.  I don't know
if there are any useful algorithms with O(n^n) though.

*eric*