How is List<T> implemented in C#?
Posted
by carter-boater
on Stack Overflow
See other posts from Stack Overflow
or by carter-boater
Published on 2010-03-29T17:47:32Z
Indexed on
2010/03/29
17:53 UTC
Read the original article
Hit count: 428
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!
© Stack Overflow or respective owner