Re: Sort benchmark and a classic paper by Gray
- From: Terje Mathisen <"terje.mathisen at tmsw.no">
- Date: Sat, 23 May 2009 21:34:49 +0200
nmm1@xxxxxxxxx wrote:
In article <SOqdnZwo4I2gLIrXnZ2dnUVZ8i6dnZ2d@xxxxxxxxxxxx>,
Terje Mathisen <"terje.mathisen at tmsw.no"> wrote:
They are both expected to run in (N), and will do so as long as the keys are sufficiently random.
And uniformly distributed - that is even more important.
With my engineering (vs pure math) background, I'm taking "sufficiently random" for a binary value to mean a uniform (flat) probability distribution.
If all the bits are indeed random, the resulting distribution is of course uniform.
Terje
--
- <Terje.Mathisen at tmsw.no>
"almost all programming can be viewed as an exercise in caching"
.
- Follow-Ups:
- Re: Sort benchmark and a classic paper by Gray
- From: Gavin Scott
- Re: Sort benchmark and a classic paper by Gray
- References:
- Sort benchmark and a classic paper by Gray
- From: Terje Mathisen
- Re: Sort benchmark and a classic paper by Gray
- From: Terje Mathisen
- Re: Sort benchmark and a classic paper by Gray
- From: nmm1
- Re: Sort benchmark and a classic paper by Gray
- From: Terje Mathisen
- Re: Sort benchmark and a classic paper by Gray
- From: nmm1
- Sort benchmark and a classic paper by Gray
- Prev by Date: Re: The coming death of all RISC chips.
- Next by Date: Re: The coming death of all RISC chips.
- Previous by thread: Re: Sort benchmark and a classic paper by Gray
- Next by thread: Re: Sort benchmark and a classic paper by Gray
- Index(es):
Relevant Pages
|
Loading