How is List<T> implemented in C#?
- by carter-boater
I was thinking about the performance of calling List<T>.Indexof(item). I am not sure if it will be a O(n) performance for a sequential algorithm or O(log(n)) performance for a binary tree??
Thanks!