laidu
diff --git a/Collapse file
‎algorithm/src/main/java/org/laidu/learn/algorithm/sort/QuickSort.java‎
Copy file name to clipboard
+84Lines changed: 84 additions & 0 deletions b/Collapse file
‎algorithm/src/main/java/org/laidu/learn/algorithm/sort/QuickSort.java‎
Copy file name to clipboard
+84Lines changed: 84 additions & 0 deletions
diff --git a/Collapse file
‎algorithm/src/site/markdown/sort-quick.md‎
Copy file name to clipboard
+22Lines changed: 22 additions & 0 deletions
Display the source diff
Display the rich diff b/Collapse file
‎algorithm/src/site/markdown/sort-quick.md‎
Copy file name to clipboard
+22Lines changed: 22 additions & 0 deletions
Display the source diff
Display the rich diff
diff --git a/Collapse file
‎algorithm/src/site/markdown/sort-selection.md‎
Copy file name to clipboard
+4-2Lines changed: 4 additions & 2 deletions
Display the source diff
Display the rich diff b/Collapse file
‎algorithm/src/site/markdown/sort-selection.md‎
Copy file name to clipboard
+4-2Lines changed: 4 additions & 2 deletions
Display the source diff
Display the rich diff
diff --git a/Collapse file
‎algorithm/src/site/markdown/template.md‎
Copy file name to clipboard
+12Lines changed: 12 additions & 0 deletions
Display the source diff
Display the rich diff b/Collapse file
‎algorithm/src/site/markdown/template.md‎
Copy file name to clipboard
+12Lines changed: 12 additions & 0 deletions
Display the source diff
Display the rich diff
@@ -0,0 +1,84 @@
+package org.laidu.learn.algorithm.sort;
+
+/**
+ * 快排
+ *
+ * @author tiancai.zang
+ * on 2018-10-31 13:05.
+ */
+public class QuickSort {
+
+    public static void main(String[] args) {
+
+        int[] input = new int[]{1,2,3,43,12,7,34};
+
+        QuickSort quickSort = new QuickSort();
+
+        int[] sort = quickSort.sort(input, 0, input.length-1);
+
+        System.out.println(sort);
+
+    }
+
+    /**
+     * @param array
+     * @return
+     */
+    public int[] sort(int[] array, int start, int end) {
+
+        if ((end - start) < 2 || Math.max(start,end) > array.length-1) {
+            return array;
+        }
+
+        int pivotIndex = (start + end) / 2;
+        int pivot = array[pivotIndex];
+
+        int i = start;
+        int j = end;
+
+        boolean iWait = false;
+        boolean jWait = false;
+
+        while (i <= j) {
+            if (array[i] > pivot) {
+                if (jWait) {
+                    swap(array,i,j);
+                    jWait = false;
+                }else {
+                    iWait = true;
+                }
+            } else {
+                i++;
+            }
+            if (array[j] < pivot) {
+                if (iWait) {
+                    swap(array,i,j);
+                    iWait = false;
+                }else {
+                    jWait = true;
+                }
+            } else {
+                j--;
+            }
+        }
+
+        if (array[Math.min(i,end)] <= pivot) {
+            swap(array,pivotIndex,Math.min(i,end));
+        }
+
+        sort(array, start, pivotIndex-1);
+        sort(array, pivotIndex+1, end);
+
+        return array ;
+    }
+
+    public void swap(int[] array, int firstIndex, int second){
+
+        if (firstIndex == second) {
+            return;
+        }
+        int temp = array[firstIndex];
+        array[firstIndex] = array[second];
+        array[second] = temp;
+    }
+}
@@ -0,0 +1,22 @@
+# 快排 算法学习
+
+## 1 场景
+> 针对一组数据进行排序
+
+## 2 原理
+### 2.1 算法
+> 
+
+### 2.2 基本步骤
+> 将数组S排序的基本算法由以下4步组成:
+* 1.如果数组S元素个数为0或者1,则返回
+* 2.数组S中任意元素为 __枢纽元(pivot)__ v
+* 3.将S中的其余元素划分两个不相交的集合: S1(所有元素均小于v) S2(所有元素均大于v)
+* 4.返回{quickSort(S1),v,quickSort(S2)}
+
+## 3 复杂度
+### 3.1 时间复杂度
+### 3.2 空间复杂度
+
+## 4 适用范围
+
@@ -1,10 +1,12 @@
 # 选择排序 算法学习
 
-## 1 原理
+## 1 场景
+
+## 2 原理
 
-## 2 实现
 ## 3 复杂度
 ### 3.1 时间复杂度
 ### 3.2 空间复杂度
+
 ## 4 适用范围
 
@@ -0,0 +1,12 @@
+# 选择排序 算法学习
+
+## 1 场景
+
+## 2 原理
+
+## 3 复杂度
+### 3.1 时间复杂度
+### 3.2 空间复杂度
+
+## 4 适用范围
+