Update 6.quickSort.md

Author: Rain120

6.quickSort.md

@@ -30,6 +30,24 @@
 ## 3. JavaScript 代码实现
 
 ```js
+// NO.1 Solution
+var quickSort = function(arr) {
+    if (arr.length <= 1) { return arr; }
+    var pivotIndex = Math.floor(arr.length / 2);   //基准位置（理论上可任意选取）
+    var pivot = arr.splice(pivotIndex, 1)[0];  //基准数
+    var left = [];
+    var right = [];
+    for (var i = 0; i < arr.length; i++){
+        if (arr[i] < pivot) {
+            left.push(arr[i]);
+        } else {
+            right.push(arr[i]);
+        }
+    }
+    return quickSort(left).concat([pivot], quickSort(right));  //链接左数组、基准数构成的数组、右数组
+};
+
+// NO.2 Solution
 function quickSort(arr, left, right) {
     var len = arr.length,
         partitionIndex,