functionquickSort(arr, left, right) { var len = arr.length, partitionIndex, left = typeof left != "number" ? 0 : left, right = typeof right != "number" ? len - 1 : right;
if (left < right) { var x = arr[right], i = left - 1, temp; for (var j = left; j <= right; j++) { if (arr[j] <= x) { i++; temp = arr[i]; arr[i] = arr[j]; arr[j] = temp; } } quickSort(arr, left, i - 1); quickSort(arr, i + 1, right); } return arr; }