add quick sort

Author: ligecarryme

基础算法篇/排序算法.md

@@ -0,0 +1,58 @@
+#### 快速排序
+
+```js
+var quickSort = function(arrays, start, end){
+    if(start < end){
+        // pivot 是分割点，pivot左边的比nums[pivot]小，右边的比nums[pivot]大
+        let pivot = partition(arrays,start,end);
+        quickSort(arrays,start,pivot-1);
+        quickSort(arrays,pivot+1,end);
+    }
+    return arrays;
+}
+
+var partition = function(nums, start, end){
+    let target = nums[end];
+    let i = start;
+    // 将小于target移到数组前面
+    for (let j = start; j < end; j++) {
+        if (nums[j]<target) {
+             swap(nums, i, j);
+             i++;
+        }
+    }
+    // 把中间的值换为用于比较的基准值
+    swap(nums,i,end);
+    return nums;
+}
+
+let arrays = [72,6,57,88,60,42,83,73,48,85]
+console.log(quickSort(arrays,0,arrays.length-1))
+```
+
+下面这种分治的算法较好理解，挖坑填数。
+
+```js
+var partition = function(nums, left, right){
+    let pivot = nums[left];
+    while(left < right){
+        while(left<right && nums[right]>pivot){ //从右向左找到比基准小的
+            right--;
+        }
+        if (left<right) {
+            nums[left] = nums[right]; //覆盖基准的值
+            left++; //左指针前进一位
+        }
+        while(left<right && nums[left]<pivot){
+            left++;
+        }
+        if (left<right) {
+            nums[right] = nums[left];
+            right--;
+        }
+    }
+    nums[left] = pivot; //left === right
+    return left;
+}
+```
+

数据结构篇/栈和队列.md

@@ -55,3 +55,7 @@ MinStack.prototype.getMin = function() {
 };
 ```
 
+##### 150.逆波兰表达式求值 [evaluate-reverse-polish-notation](https://leetcode-cn.com/problems/evaluate-reverse-polish-notation/)
+
+##### 133.克隆图 [clone-graph](https://leetcode-cn.com/problems/clone-graph/)
+