fix: 排序算法

Author: ligecarryme

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

@@ -1,52 +1,52 @@
 #### 快速排序
 
 ```js
-var quickSort = function(arrays, start, end){
-    if(start < end){
+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);
+        let pivot = partition(arrays, start, end);
+        quickSort(arrays, start, pivot - 1);
+        quickSort(arrays, pivot + 1, end);
     }
     return arrays;
 }
 
-var partition = function(nums, start, end){
+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++;
+        if (nums[j] < target) {
+            [nums[i], nums[j]] = [nums[j], nums[i]]
+            i++;
         }
     }
     // 把中间的值换为用于比较的基准值
-    swap(nums,i,end);
-    return nums;
+    [nums[i], nums[end]] = [nums[end], nums[i]]
+    return i;
 }
 
-let arrays = [72,6,57,88,60,42,83,73,48,85]
-console.log(quickSort(arrays,0,arrays.length-1))
+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){
+var partition = function (nums, left, right) {
     let pivot = nums[left];
-    while(left < right){
-        while(left<right && nums[right]>pivot){ //从右向左找到比基准小的
+    while (left < right) {
+        while (left < right && nums[right] > pivot) { //从右向左找到比基准小的
             right--;
         }
-        if (left<right) {
+        if (left < right) {
             nums[left] = nums[right]; //覆盖基准的值
             left++; //左指针前进一位
         }
-        while(left<right && nums[left]<pivot){
+        while (left < right && nums[left] < pivot) {
             left++;
         }
-        if (left<right) {
+        if (left < right) {
             nums[right] = nums[left];
             right--;
         }
@@ -138,3 +138,12 @@ let arr = [2,4,1,5,8,6,7,9]
 console.log(heapSort(arr))
 ```
 
+## 参考
+
+[十大经典排序](https://www.cnblogs.com/onepixel/p/7674659.html)
+
+[二叉堆](https://labuladong.gitbook.io/algo/shu-ju-jie-gou-xi-lie/er-cha-dui-xiang-jie-shi-xian-you-xian-ji-dui-lie)
+
+## 练习
+
+-  手写快排、归并、堆排序