C # Advanced Programming Summary----A small summary of the collection

Summary of the collection

The above article describes how to handle different types of collections,The size of the array is fixed,but you can use the list as a dynamically growing collection.queues access elements in FIFO.the stack accesses elements in a last-in-first-out manner.linked lists can quickly insert and delete elements,But the search operation is slow.dictionaries can be used with keys and values,its search and insert operations are faster.set for unique items,it can be unordered.HashSet,or it can be ordered.Sortedset<t>. Observablecollection<t>provides the time that is triggered when a change in the element in the list occurs.

Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

C # Advanced Programming Summary----A small summary of the collection