Re: On the complexity of determining whether n numbers are distinct
- From: goanna <spamtrap@xxxxxxxxxx>
- Date: Mon, 25 Sep 2006 11:59:19 GMT
"eKo1" <berndlosert@xxxxxxxxxxxx> writes:
Markus Triska wrote:
1. We don't know a priori the size of the vector.
We enlarge it on demand.
Or better yet, we can find the largest number in the list and make the
vector that size.
You're going round in circles ... trying to use a clever data structure
to avoid comparisons, but now you first need to find the largest number.
.
- Follow-Ups:
- References:
- On the complexity of determining whether n numbers are distinct
- From: eKo1
- Re: On the complexity of determining whether n numbers are distinct
- From: Markus Triska
- Re: On the complexity of determining whether n numbers are distinct
- From: eKo1
- Re: On the complexity of determining whether n numbers are distinct
- From: Markus Triska
- Re: On the complexity of determining whether n numbers are distinct
- From: eKo1
- Re: On the complexity of determining whether n numbers are distinct
- From: Markus Triska
- Re: On the complexity of determining whether n numbers are distinct
- From: eKo1
- On the complexity of determining whether n numbers are distinct
- Prev by Date: Re: On the complexity of determining whether n numbers are distinct
- Next by Date: Re: On the complexity of determining whether n numbers are distinct
- Previous by thread: Re: On the complexity of determining whether n numbers are distinct
- Next by thread: Re: On the complexity of determining whether n numbers are distinct
- Index(es):
Relevant Pages
|