递归
function quick(arr, left = 0, right = arr.length - 1) {
if (left >= right) return;
var i = left, j = right, flag = i;
while(i < j) {
while(arr[j] >= arr[flag] && j > flag) j --;
if (i >= j) break;
while(arr[i] <= arr[flag] && i < j) i ++;
var temp = arr[flag];