数据结构与算法之排序（2）选择排序 ——in dart

 1 import ‘dart:math‘ show Random;
 2 
 3 void main() {
 4   final seed = 100, rnd = Random(), length = 100;
 5   var list =
 6       List<int>.generate(length, (i) => rnd.nextInt(seed), growable: false);
 7   print(list);
 8   print(‘---------------------‘);
 9   selectSort(list);
10   print(list);
11 }
12 
13 void selectSort(List<int> a) {
14   for (var i = 0; i < a.length - 1; i++) {
15     var mi = i;
16     for (var j = i + 1; j < a.length; j++) {
17       if (a[j] < a[mi]) mi = j;
18     }
19     if (i != mi) {
20       var t = a[i];
21       a[i] = a[mi];
22       a[mi] = t;
23     }
24   }
25 }