programTang
diff --git a/‎build/classes/main/org/tj/algorithms/CountOne.class‎
854 Bytes b/‎build/classes/main/org/tj/algorithms/CountOne.class‎
854 Bytes
diff --git a/‎build/classes/main/org/tj/algorithms/Sort.class‎
2.11 KB b/‎build/classes/main/org/tj/algorithms/Sort.class‎
2.11 KB
diff --git a/‎…sses/main/org/tj/sort/BinarySearch.class‎ ‎…rg/tj/algorithms/sort/BinarySearch.class‎build/classes/main/org/tj/sort/BinarySearch.class renamed to build/classes/main/org/tj/algorithms/sort/BinarySearch.class
1.53 KB b/‎…sses/main/org/tj/sort/BinarySearch.class‎ ‎…rg/tj/algorithms/sort/BinarySearch.class‎build/classes/main/org/tj/sort/BinarySearch.class renamed to build/classes/main/org/tj/algorithms/sort/BinarySearch.class
1.53 KB
diff --git a/‎build/classes/main/org/tj/algorithms/sort/MaxSonArrSum.class‎
1.35 KB b/‎build/classes/main/org/tj/algorithms/sort/MaxSonArrSum.class‎
1.35 KB
diff --git a/‎build/classes/main/org/tj/algorithms/sort/Sort.class‎
612 Bytes b/‎build/classes/main/org/tj/algorithms/sort/Sort.class‎
612 Bytes
diff --git a/‎build/classes/main/org/tj/jvm/gc/GCRootsTest.class‎
1.03 KB b/‎build/classes/main/org/tj/jvm/gc/GCRootsTest.class‎
1.03 KB
diff --git a/‎build/classes/main/org/tj/oop/reference/ReferenceTest.class‎
1.01 KB b/‎build/classes/main/org/tj/oop/reference/ReferenceTest.class‎
1.01 KB
diff --git a/‎build/classes/main/org/tj/thread/ThreadSafeDemo$1.class‎
1001 Bytes b/‎build/classes/main/org/tj/thread/ThreadSafeDemo$1.class‎
1001 Bytes
diff --git a/‎build/classes/main/org/tj/thread/ThreadSafeDemo.class‎
2.27 KB b/‎build/classes/main/org/tj/thread/ThreadSafeDemo.class‎
2.27 KB
diff --git a/‎src/main/java/org/tj/algorithms/Sort.java‎
Lines changed: 78 additions & 0 deletions b/‎src/main/java/org/tj/algorithms/Sort.java‎
Lines changed: 78 additions & 0 deletions
@@ -0,0 +1,78 @@
+package org.tj.algorithms;
+
+import java.util.*;
+
+/**
+ * Created by 001 on 16/8/16.
+ */
+public class Sort {
+
+//    插入排序
+//    直接插入排序
+    public static void straightInsertionSort(int []a){
+        int length = a.length;
+        for (int i=1;i<length;i++){
+            if (a[i]<a[i-1]){
+
+            }
+        }
+    }
+
+
+    static void quickSort(int [] a){
+        quickSort(a,0,a.length-1);
+    }
+//    快排  平均时间复杂度logN 最坏情况n2
+    static void quickSort(int [] a,int begin,int end){
+        int tmp = a[begin];
+        int i = begin,j = end;
+
+        if (begin<end){
+            while (begin<end){
+                while (begin<end && tmp<=a[end]){
+                    end--;
+                }
+                a[begin] = a[end];
+
+                while (begin<end && tmp>a[begin]){
+                    begin++;
+                }
+                a[end] = a[begin];
+            }
+            a[begin] = tmp;
+            quickSort(a,i,begin-1);
+            quickSort(a,end+1,j);
+        }
+    }
+
+
+
+
+
+    static void printArray(int a[]){
+        int j = a.length;
+        for (int i=0;i<j;i++){
+            System.out.print(" "+a[i]);
+        }
+    }
+
+    public static void main(String[] args) {
+        int[] a = {32,13,4,3,63,7,52,3,47};
+//        quickSort(a);
+//        straightInsertionSort(a);
+//        printArray(a);
+
+        List<Integer> list = new ArrayList<>();
+        for (int i=1;i<30;i++){
+            list.add(i);
+        }
+        Collections.shuffle(list);
+        for (int j=0;j<5;j++){
+            System.out.print(list.get(j)+" ");
+        }
+//        for (Object object : set.toArray()){
+//            System.out.println((Integer)object);
+//        }
+
+    }
+}