Description: The array size is fixed. But you can use the list as a collection of dynamic growth. FIFO queue to access elements. The stack first-out way to access elements. The list can quickly insert and delete elements. But the search operation is relatively slow. You can use the dictionary by keys and values. Its search and insert operations faster. Ordered SortedSet <T> unordered set of entries for uniquely HashSet <T>