Fix another broken generic type.

lib/src/algorithms.dart

 // Copyright (c) 2013, the Dart project authors.  Please see the AUTHORS file
 // for details. All rights reserved. Use of this source code is governed by a
 // BSD-style license that can be found in the LICENSE file.
 
 import "dart:math" as math;
 
 import "utils.dart";
 
 /// Returns a position of the [value] in [sortedList], if it is there.
 ///
@@ skipping 156 matching lines @@
   // Special case the first split instead of directly calling
   // _mergeSort, because the _mergeSort requires its target to
   // be different from its source, and it requires extra space
   // of the same size as the list to sort.
   // This split allows us to have only half as much extra space,
   // and it ends up in the original place.
   int middle = start + ((end - start) >> 1);
   int firstLength = middle - start;
   int secondLength = end - middle;
   // secondLength is always the same as firstLength, or one greater.
-  var scratchSpace = new List<T>(secondLength);
+  var scratchSpace = new List/*<T>*/(secondLength);
   _mergeSort(list, compare, middle, end, scratchSpace, 0);
   int firstTarget = end - firstLength;
   _mergeSort(list, compare, start, middle, list, firstTarget);
   _merge(compare,
          list, firstTarget, end,
          scratchSpace, 0, secondLength,
          list, start);
 }
 
 /// Performs an insertion sort into a potentially different list than the
@@ skipping 91 matching lines @@
       target.setRange(targetOffset, targetOffset + (firstEnd - cursor1),
           firstList, cursor1);
       return;
     }
   }
   // First list empties first. Reached by break above.
   target[targetOffset++] = secondElement;
   target.setRange(targetOffset, targetOffset + (secondEnd - cursor2),
       secondList, cursor2);
 }