Code:public int Add(object value) { object[] tmp = new object[_items.Length + 1]; for (int i = 0; i < _items.Length; i++) { tmp[i] = _items[i]; } tmp[tmp.Length - 1] = value; _items = tmp; return tmp.Length - 1; }
Code:public int Add(object value) { object[] tmp = new object[_items.Length + 1]; for (int i = 0; i < _items.Length; i++) { tmp[i] = _items[i]; } tmp[tmp.Length - 1] = value; _items = tmp; return tmp.Length - 1; }
"Array.Resize()" might be faster than your loop.
Devoted my life to programming...
i want to implement Ilist method Add(object value) not resize how do you think if i do in one for loop will it be faster than this?
But that's what you're doing in this method, isn't it? You create a new, longer array, copy the old elements to it and add a new one at the end. Array.Resize() can do the first two steps for you.Originally Posted by badger777
Devoted my life to programming...
can you show me how can it be done? your version
Maybe you should forget about speed optimization until you are comfortable with the language...
Devoted my life to programming...
Why aren't you just using a List<object> instead of an array, which already does what you're trying to do?
If you understand what you're doing, you're not learning anything.
