quickSort-mergeSort-heapSort-radixSort 非递归快速排序归并排序堆排序基数排序的实现 //快速排序 function quickSort ( arr ) { var parts = [ [ 0 , arr . length - 1 ] ] ; while ( parts . length ) { var part = parts . shift ( ) ; var l = part [ 0 ] ;