Re: Create a string with (n) copies of the same character
- From: "Dave Anderson" <NPQRWPDWZGSP@xxxxxxxxxxxxx>
- Date: Mon, 24 Sep 2007 12:08:59 -0500
"Dr J R Stockton" wrote:
For shortish strings, yours is faster. For longish strings,
mine is much faster...
Isn't that assessment entirely implementation-dependent?
No. Not entirely.
[O(N) discussion trimmed]
That only addresses your second assertion. I agree that yours is O(log N). No need to specify base 2, as I'm sure you know.
--
Dave Anderson
Unsolicited commercial email will be read at a cost of $500 per message. Use of this email address implies consent to these terms.
.
- Follow-Ups:
- Re: Create a string with (n) copies of the same character
- From: Dr J R Stockton
- Re: Create a string with (n) copies of the same character
- References:
- Create a string with (n) copies of the same character
- From: \(O\)enone
- Re: Create a string with (n) copies of the same character
- From: Evertjan.
- Re: Create a string with (n) copies of the same character
- From: Evertjan.
- Re: Create a string with (n) copies of the same character
- From: Dr J R Stockton
- Re: Create a string with (n) copies of the same character
- From: Dave Anderson
- Re: Create a string with (n) copies of the same character
- From: Dr J R Stockton
- Create a string with (n) copies of the same character
- Prev by Date: retecasa script
- Next by Date: Re: How to optimize this JavaScript?
- Previous by thread: Re: Create a string with (n) copies of the same character
- Next by thread: Re: Create a string with (n) copies of the same character
- Index(es):
Relevant Pages
|
Loading