title: List.Sort IComparer performance
body: <p>I'm trying to sort a pair of int arrays (int[] a; int[] b;)</p>
  
  <p>If I use Array.Sort(a,b) then the performance is great.</p>
  
  <p>However, I'd prefer to use a List&lt;> and load the int pairs in a struct.
  I can get this to work using Array.Sort() with an overload that provides a simple comparer for the struct but it's about 4 times slower than the Array.Sort(a,b)</p>
  
  <p>Is that normal?</p>