Is there a better method of adding an element to an array than iteration? [duplicate]

Question

Whenever I need to add an element to an array I've always used this algorithm

data toAdd = 10;

data[] theArray = { 1, 2, 3, 4, 5, 6, 7, 8, 9 };

data[] tempArray = new int[theArray.Length + 1];

for (int i = 0; i < theArray.Length; i++)
{
    tempArray[i] = theArray[i];
}

theArray = new data[tempArray.Length];

for (int i = 0; i < theArray.Length; i++)
{
    theArray[i] = tempArray[i];
}

theArray[theArray.Length - 1] = toAdd;

However I was wondering if there was a better way to do this, as with much larger arrays this will require a large amount of computing time.

Arrays are fixed-size, List<T> (or any of a multitude of other collections) aren't. First verify if you're trying to screw something with a hammer. Then look at Array.Copy. — Jeroen Vannevel
– Jeroen Vannevel, Commented Jan 1, 2015 at 20:18

fejesjoco · Accepted Answer · 2015-01-01 20:18:56Z

0

You could use Array.Resize. But you should really use an ArrayList or List<> which do this much more easily and effectively.

answered Jan 1, 2015 at 20:18

fejesjoco

12k4 gold badges39 silver badges65 bronze badges

Sign up to request clarification or add additional context in comments.

1 Comment

Jeppe Stig Nielsen Over a year ago

Upvoted. But don't use ArrayList, prefer the generic List<>.

Collectives™ on Stack Overflow

Is there a better method of adding an element to an array than iteration? [duplicate]

1 Answer 1

1 Comment

Linked

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

1 Comment

Linked

Related