First I'm sorry for my bad English, then my question;
I know that there are many questions like this one, in here, but I didn't find a straight answer. Is List<T>
implemented using some sort of "linked list" mechanism? Or it is just an over-engineered array?
I'm interested in performance issues of lists, like sorting, inserting and deleting items. E.g. for insertion action, 'linked list' just defines some new connections, but array needs to shift its values. What about list?