Dart实现 线性搜索，插入排序，选择排序

Author: tianqing.liang

01Linear-Search/LinearSearch.dart

@@ -0,0 +1,20 @@
+void main(){
+  var data = {24, 18, 12, 9, 16, 66, 32, 4};
+  if(LinearSearch(data.toList(), 4)){
+    print("搜索到数字");
+  }else{
+    print("没搜索到数字");
+  }
+}
+bool search(List arr,Object target){
+  return arr.contains(target);
+}
+
+bool LinearSearch(List arr,Object target){
+     for(int i =0;i<arr.length;i++){
+        if(arr[i] == target){
+          return true;
+        }
+     }
+     return false;
+}

02Selection-Sort/Selection-sort.dart

@@ -0,0 +1,43 @@
+/**
+ * 选择排序
+ */
+void main(){
+
+  var list = [2, 4, 6, 3, 1, 5];
+  var list2 = ["2","4","6","3","1","5"];
+  var list3 = [new Student("xiaoming", 90),new Student("xiaoli", 70),new Student("xiaowang", 80),new Student("skyl", 100),];
+  selectionSort(list2);
+  selectionSort(list3);
+  list3.forEach((element) {print(element.name);print(element.score);});
+}
+void selectionSort(List arr){
+  print("---------------------选择排序");
+  for(int i = 0; i < arr.length; i ++){
+    int minIndex = i;
+    for(int j = i; j < arr.length; j ++){
+      if(arr[j].compareTo(arr[minIndex]) > 0)
+        minIndex = j;
+    }
+    swap(arr, i, minIndex);
+  }
+  arr.forEach((element) {print(element);});
+}
+
+void swap(arr, int i, int j) {
+  var t = arr[i];
+  arr[i] = arr[j];
+  arr[j] = t;
+}
+
+class Student {
+
+  String? name;
+  int? score;
+
+  Student(this.name,this.score);
+
+  @override
+  int compareTo(other) {
+    return other.score - this.score;
+  }
+}

02Selection-Sort/InsertionSort.dart renamed to 03Insertion-Sort/InsertionSort.dart

@@ -2,5 +2,7 @@
 
 #### 介绍
 使用Dart语言编写一套算法与数据结构
-1. 插入排序
+1. 线性搜索
+2. 选择排序
+3. 插入排序