Dynamic Array (vectors) ... !?

It may be easier to just allocate up to the max size array need but keep a counter as to how much of it your using. That''s the fastest way I can think of handling it.

Hey, I asked this same question not too long ago. One thing you can do is use malloc()/realloc() to change your array size dynamically.

Martee
Magnum Games

You should use STL, no need to reinvent the wheel.

-Jussi

Hi,

Thanks for those answers. I had already think about a predefined Array[Max_Object]. But i dont love this solution, i want it to be very versatile. So a Linked-List should work, but it''s very slow with a high number of object.

Slekrank : Hi, i''ve already heard about STL, but i''m not sure what that is? Did this is a bunch of classes (special lib)!?
Explain please. Thanks.


Thanks All,

And dont forget, Happy Coding

LowRad

quote:

---

Original post by LowRad
i''ve already heard about STL, but i''m not sure what that is? Did this is a bunch of classes (special lib)!?
Explain please. Thanks.

---

STL is a library of template classes. It contains many classes like linked lists, btrees and, of course, arrays. It is easy to use, but very controversed about speed... I personnally don''t think it''s speed effective. And it''s ANSI standardized.
If you want some infos on this topic, just go to this site.

Programming is: A. The art of debugging a blank sheet of paper (or an empty file). B. A pastime similar to banging one's head against a wall, but with fewer opportunities for reward. C. The most fun you can have with your clothes on (although clothes are not mandatory).