Getting distinct values from arrays (through .NET Framework history)

9 Comments

• Nice, interesting post, and a good application of a generic method in the .NET 2.0 section.
  

• Word of warning: If you have more than a couple hundred elements in your array, you'd be much better off doing a quick sort on your list then doing a single pass through the array and only add to the distinct list when the element is not the same as the previous element. Depending on your memory requirements, you could also use a dictionary (or the new HashSet) to keep track of what has already been added. If I remember correctly this later method is what LINQ's Distinct keyword does.
  

• Yes, that's correct - you should sort larger arrays before asking distinct values because checking operations work faster when input array is sorted.
  

• Nice, simply superb to understand ...
  

• Is there an algorithm to distinct value in array?
  Thx
  

• Use Ling to get distinct values. Just add reference to System.Linq namespace and your arrays get a lot of extension methods you can use. ust go to array and open IntelliSense to see what is there for you.
  

• very helpullllll........and nice article.
  thanx...!
  

• Very helpful article! Thanks
  

• very helpful as it shown the progress from version to version.. elaboratively explained...