Re: Benchmarks
- From: Harald van Dijk <truedfx@xxxxxxxxx>
- Date: Tue, 11 Nov 2008 22:00:53 +0000 (UTC)
On Tue, 11 Nov 2008 16:47:49 -0500, CBFalconer wrote:
Ben Bacarisse wrote:
CBFalconer <cbfalconer@xxxxxxxxx> writes:
But, if we use reasonable notation and ask about O(n*n) we find that
to be much slower than O(n log n).
do you really dispute that the time complexity of
merge sort (typically measured as the comparisons made) is also O(n*n)?
Yes, I do dispute it.
Then you should look up what exactly O(n*n) means. It isn't what you think
it is.
.
- References:
- Re: Benchmarks
- From: Juha Nieminen
- Re: Benchmarks
- From: Ben Bacarisse
- Re: Benchmarks
- From: CBFalconer
- Re: Benchmarks
- From: Ben Bacarisse
- Re: Benchmarks
- From: CBFalconer
- Re: Benchmarks
- From: Ben Bacarisse
- Re: Benchmarks
- From: CBFalconer
- Re: Benchmarks
- Prev by Date: Re: struct
- Next by Date: Re: Benchmarks
- Previous by thread: Re: Benchmarks
- Next by thread: Re: Benchmarks
- Index(es):
Relevant Pages
|