冒泡：
function bubble(a){let tempfor(let i=0,end=a.length-1;i<=end;i++){temp = a[i]for(let j=i;j<=end;j++){if(a[j] 插排:
function insertion(arr){let handle = [Infinity]for(let i=0,len=arr.length;i 快排：
function quickSort(arr,l,r){if(l>=r) returnif(arguments.length===1){l=0r=arr.length-1}let i=l,j=rlet a = arr[i]let right = truewhile(i 堆排：
【何为冒泡排序、插入排序、快速排序、堆排序？】function heapSort(arr,banLen=0){let length = arr.lengthif(length === banLen) returnlet grade = Math.floor(Math.log2(length-banLen))-1let maxPos=length-banLen-1let adjustHeap=(arr,index)=>{let len = Math.pow(2,index)let max,leftLeaf,rightLeaffor(let i=len-1;imaxPos?-Infinity:arr[2*i+1]rightLeaf = 2*i+2>maxPos?-Infinity:arr[2*i+2]max = Math.max(arr[i],leftLeaf,rightLeaf)if(arr[2*i+1]===max) [arr[i],arr[2*i+1]]=[arr[2*i+1],arr[i]]if(arr[2*i+2]===max) [arr[i],arr[2*i+2]]=[arr[2*i+2],arr[i]]}}for(let i=grade;i>=0;i--){adjustHeap(arr,i)}[arr[0],arr[maxPos]]=[arr[maxPos],arr[0]]heapSort(arr,++banLen)}