Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I had a performance problem today that showed up after some profiling. Calls to List<>.RemoveAt(0) were taking a long time. I’d assumed System.Collections.Generic.List would be implemented with a list data structure, but actually its implemented as an array.
Does anyone else find that surprising?
No. It’s similar to the C++ standard std::vector type, as well as a generic replacement for the C# ArrayList type, which has “Array” in its name. If you want linked list behavior, use the LinkedList type.