Javascript Quick Sort faster than 95%
\tvar sortArray = function(nums) {\n\t\tlet len = nums.length;\n\t\tif(len < 2) return nums;\n\n\t\tquickSort(nums, 0, len-1)\n\t\treturn nums\n\t};\n\n\tvar qu
\tvar sortArray = function(nums) {\n\t\tlet len = nums.length;\n\t\tif(len < 2) return nums;\n\n\t\tquickSort(nums, 0, len-1)\n\t\treturn nums\n\t};\n\n\tvar quickSort = function(nums, start, end){\n\t\tif(start >= end) return\n\t\tlet left = start, right = end;\n\t\tlet pivot = nums[Math.floor((start+end) / 2)];\n\t\twhile(left <= right) {\n\t\t\twhile(left <= right && nums[left] < pivot){\n\t\t\t\tleft++\n\t\t\t}\n\t\t\twhile(left <= right && nums[right] > pivot){\n\t\t\t\tright--\n\t\t\t}\n\t\t\tif(left <= right){\n\t\t\t\tlet temp = nums[left]\n\t\t\t\tnums[left] = nums[right]\n\t\t\t\tnums[right] = temp\n\t\t\t\tleft++\n\t\t\t\tright--\n\t\t\t}\n\t\t}\n\t\tquickSort(nums, start, right)\n\t\tquickSort(nums, left, end)\n\t}
['Sorting', 'JavaScript']