JavaScript implementation of sorting algorithm

Bubble sort

Let compare = (n1, n2) = N1-n2;let Bubblesort = (arr, cmp = Compare) + = (Let   i = 0; i < arr . length;  i++) {     for (Let j = i; j > 0; j--) {      if (CMP (ARR[J], arr[j-1]) < 0) {        [arr[j], arr[j -1]] = [arr[j-1], arr[j]];  }} return arr;};

Insert Sort

Let Insertionsort = (arr) + {= (let     i = 0; i < a.length; i++) {let        tocmp = arr[i];         for (Let j = i; j > 0 && tocmp < a[j-1]; j--)            ARR[J] = a[j-1];        ARR[J] = tocmp;    }    return arr;}

Select sort

var function (arr) {Let  i,m,j;   for (i =-1; ++i < a.length;) {for     (m = j = i; ++j < a.length;) {      if (Arr[m] > arr[j]) m = j;    }    return arr;}

Merge sort

Let MergeSort = (arr) = = {if(Arr.length < 2)returnArr Let middle = parseint (ARR.LENGTH/2), left = Arr.slice (0, middle), right = Arr.slice (middle);returnMerge (MergeSort (left), MergeSort (right));} Let merge = (left, right) + = (let result = []; while(Left.length && right.length)    {left[0] <= right[0]?  Result.push (Left.shift ()): Result.push (Right.shift ()); } while(left.length) Result.push (Left.shift ()); while(right.length) Result.push (Right.shift ());returnResult;}

Quick Sort

let quicksort = function  (arr) {if  (arr.length <= 1) return  arr;  let pivot = Math.floor ((arr.length-1)/2);  Let val = Arr[pivot], less = [], more = [];  Arr.splice (pivot, 1);  Arr.foreach (function  (e,i,a) {e < val? Less.push (E): More.push (e);  }); return  (Quicksort (less)). Concat ([Val],quicksort (more))} 

Source: http://www.ido321.com/1492.html

JavaScript implementation of sorting algorithm