data-struct-sort

fantj2016 · fantj2016 · commit 9869f97d35c8 · 2017-12-21T10:41:15.000+08:00
diff --git a/src/com.fantj.dataStruct/simplesort/BubbleSort.java b/src/com.fantj.dataStruct/simplesort/BubbleSort.java
@@ -0,0 +1,22 @@
+package com.fantj.dataStruct.simplesort;
+
+/**
+ * &#20882;&#27873;&#25490;&#24207;
+ * Created by Fant.J.
+ * 2017/12/20 19:43
+ */
+public class BubbleSort {
+    //&#23567;&#20540;&#24448;&#21069;&#25490;
+    public static void sort(long [] arr){
+        long tmp = 0;
+        for (int i = 0;i < arr.length;i++){
+            for (int j = arr.length-1;j>i;j--){
+                if (arr[j]<arr[j-1]){
+                    tmp = arr[j];
+                    arr[j] = arr[j-1];
+                    arr[j-1] = tmp;
+                }
+            }
+        }
+    }
+}
diff --git a/src/com.fantj.dataStruct/simplesort/InsertSort.java b/src/com.fantj.dataStruct/simplesort/InsertSort.java
@@ -0,0 +1,26 @@
+package com.fantj.dataStruct.simplesort;
+
+/**
+ * Created by Fant.J.
+ * 2017/12/20 20:56
+ */
+public class InsertSort {
+    public static void sort(long [] arr){
+        int i, j;
+        long target;
+        //&#20551;&#23450;&#31532;&#19968;&#20010;&#20803;&#32032;&#34987;&#25918;&#21040;&#20102;&#27491;&#30830;&#30340;&#20301;&#32622;&#19978;
+        //&#36825;&#26679;&#65292;&#20165;&#38656;&#36941;&#21382;1 - n-1
+        for (i = 1; i < arr.length; i++)
+        {
+            j = i;
+            target = arr[i];
+            //&#22914;&#26524;&#24403;&#21069;&#20540;&#23567;&#20110;&#21069;&#38754;&#30340;&#20540;&#65292;&#23601;&#20132;&#25442;&#23427;&#20204;
+            while (j > 0 && target < arr[j - 1])
+            {
+                arr[j] = arr[j - 1];
+                j--;
+            }
+            arr[j] = target;
+        }
+    }
+}
diff --git a/src/com.fantj.dataStruct/simplesort/SelectionSort.java b/src/com.fantj.dataStruct/simplesort/SelectionSort.java
@@ -0,0 +1,27 @@
+package com.fantj.dataStruct.simplesort;
+
+/**
+ * &#36873;&#25321;&#25490;&#24207;
+ * Created by Fant.J.
+ * 2017/12/20 19:56
+ */
+public class SelectionSort {
+    public static void sort(long []arr){
+
+        int k = 0;
+        long temp = 0;
+        for (int i = 0;i<arr.length-1;i++){
+            k = i;
+            for (int j = i;j<arr.length;j++){
+                if (arr[j] < arr[k]){
+                    //&#25343;&#21040;&#26368;&#23567;&#20540;&#23545;&#24212;&#30340;index
+                    k = j;
+                }
+            }
+            //&#23558;k(&#26368;&#23567;&#20540;)&#21644;i(&#24403;&#21069;&#20540;)&#20132;&#25442;
+            temp = arr[i];
+            arr[i] = arr[k];
+            arr[k] = temp;
+        }
+    }
+}
diff --git a/src/com.fantj.dataStruct/simplesort/TestSort.java b/src/com.fantj.dataStruct/simplesort/TestSort.java
@@ -0,0 +1,38 @@
+package com.fantj.dataStruct.simplesort;
+
+/**
+ * Created by Fant.J.
+ * 2017/12/20 19:50
+ */
+public class TestSort {
+    public static void main(String[] args) {
+        long []arr = new long[5];
+        arr[0] = 19;
+        arr[1] = 18;
+        arr[2] = 20;
+        arr[3] = 17;
+        arr[4] = 21;
+//        arr[0] = 19;
+//        arr[1] = 18;
+//        arr[2] = 17;
+//        arr[3] = 16;
+//        arr[4] = 15;
+
+        System.out.print("[");
+        for (long num :arr){
+            System.out.print(num + " ");
+        }
+        System.out.print("]");
+        System.out.println();
+
+//        BubbleSort.sort(arr);
+//        SelectionSort.sort(arr);
+        InsertSort.sort(arr);
+        System.out.print("[");
+        for (long num :arr){
+            System.out.print(num + " ");
+        }
+        System.out.print("]");
+
+    }
+}
