Re: OODL: Any array classes

[DeRobertis]

At 2:18 PM +0200 on 7/23/99, M. Uli Kusterer wrote:
>>Have you thought of using a linked list instead of an array.
>>This way you could have arrays of variable sizes.
>
>Andre,
>
> I've been doing a variable-size array all the time (just using a
>malloc()ed pointer as an array). Basically, map and vector work in a
>similar way as your list, they're just a bit more sophisticated since they
>sort the entries in a way that helps them locate them faster.

To find an element in a plain old ____ by a kep (e.g., type) is ____:

        data structurn                          time
        linked list                             O(n)
        vector                                  O(n)
        map                                     O(logN)
        hash_map                                approaches O(1)

Use Apple's graphing calulator and see which is less -- O(n) or O(logN). Or
graph the derivatives and see which grows faster.