Dart实现插入排序

Author: tianqing.liang

.gitignore

@@ -1,24 +1,13 @@
-# Compiled class file
-*.class
-
-# Log file
-*.log
-
-# BlueJ files
-*.ctxt
-
-# Mobile Tools for Java (J2ME)
-.mtj.tmp/
-.idea/*
-
-# Package Files #
-*.jar
-*.war
-*.nar
-*.ear
-*.zip
-*.tar.gz
-*.rar
-
-# virtual machine crash logs, see http://www.java.com/en/download/help/error_hotspot.xml
-hs_err_pid*
+# See https://www.dartlang.org/tools/private-files.html
+
+# Files and directories created by pub
+.packages
+.pub/
+build/
+# If you're building an application, you may want to check-in your pubspec.lock
+pubspec.lock
+
+# Directory created by dartdoc
+# If you don't generate documentation locally you can remove this line.
+doc/api/
+.idea/

02Selection-Sort/InsertionSort.dart

@@ -0,0 +1,98 @@
+/**
+ * 插入排序
+ * 1、Dart自带插入排序算法
+ * 2、手动实现插入排序算法
+ * 3、 源码部分
+ *  dart数组天然支持泛型，
+ *  compare 是实现比对接口
+ */
+void main() {
+  var list = [2, 4, 6, 3, 1, 5];
+  var list2 = ["2","4","6","3","1","5"];
+  sort(list);
+  insertionSort(list);
+  sort(list2);
+  insertionSort(list2);
+}
+
+//Dart语言原生方法
+void sort(List arr) {
+  print("Dart自带排序算法----------------------");
+  arr.sort();
+  arr.forEach((element) {
+    print(element);
+  });
+
+}
+
+void insertionSort(List arr) {
+  print("手动实现插入排序算法----------------------");
+  for (int i = 0; i < arr.length; i++) {
+    for (int j = i; j - 1 >= 0; j--) {
+      if (Comparable.compare(arr[j] ,arr[j - 1]) < 0) {
+        swap(arr, j - 1, j);
+      }
+    }
+  }
+  arr.forEach((element) {
+    print(element);
+  });
+
+}
+
+void swap(arr, int i, int j) {
+  var t = arr[i];
+  arr[i] = arr[j];
+  arr[j] = t;
+}
+
+//  Dart 源码使用的是阀值，32
+//  当在32以内使用插入排序，当在32以外使用双向快排
+//  static const int _INSERTION_SORT_THRESHOLD = 32;
+//  /**
+//   * Sorts all elements of the given list [:a:] according to the given
+//   * [:compare:] function.
+//   *
+//   * The [:compare:] function takes two arguments [:x:] and [:y:] and returns
+//   *  -1 if [:x < y:],
+//   *   0 if [:x == y:], and
+//   *   1 if [:x > y:].
+//   *
+//   * The function's behavior must be consistent. It must not return different
+//   * results for the same values.
+//   */
+//  static void sort<E>(List<E> a, int compare(E a, E b)) {
+//    _doSort(a, 0, a.length - 1, compare);
+//  }
+//
+//  /**
+//   * Sorts all elements in the range [:from:] (inclusive) to [:to:] (exclusive)
+//   * of the given list [:a:].
+//   *
+//   * If the given range is invalid an "OutOfRange" error is raised.
+//   * TODO(floitsch): do we want an error?
+//   *
+//   * See [:sort:] for requirements of the [:compare:] function.
+//   */
+//  static void sortRange<E>(List<E> a, int from, int to, int compare(E a, E b)) {
+//    if ((from < 0) || (to > a.length) || (to < from)) {
+//      throw "OutOfRange";
+//    }
+//    _doSort(a, from, to - 1, compare);
+//  }
+//
+//  /**
+//   * Sorts the list in the interval [:left:] to [:right:] (both inclusive).
+//   */
+//  static void _doSort<E>(
+//      List<E> a, int left, int right, int compare(E a, E b)) {
+//    if ((right - left) <= _INSERTION_SORT_THRESHOLD) {
+//      _insertionSort(a, left, right, compare);
+//    } else {
+//      _dualPivotQuicksort(a, left, right, compare);
+//    }
+//  }
+//
+//
+
+

Dart-Basic.iml

@@ -0,0 +1,10 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<module type="WEB_MODULE" version="4">
+  <component name="NewModuleRootManager" inherit-compiler-output="true">
+    <exclude-output />
+    <content url="file://$MODULE_DIR$" />
+    <orderEntry type="inheritedJdk" />
+    <orderEntry type="sourceFolder" forTests="false" />
+    <orderEntry type="library" name="Dart SDK" level="project" />
+  </component>
+</module>