L9m/index.html

## index.html
<!DOCTYPE html>
<html>
<head>
  <meta charset="utf-8">
  <meta name="viewport" content="width=device-width">
  <title>JS Bin</title>
</head>
<body>

<script id="jsbin-javascript">
let quickSort = function (array) {
  quick(array, 0, array.length - 1)
}

let quick = function (array, left, right) {
  var index
  if (array.length > 1) {
    var pivot = array[Math.floor((right + left)/2)],
        i = left,
        j = right;
    for (;i <= j;) {
      while (array[i] < pivot) {
        i++
      }
      while (array[j] > pivot) {
        j--
      }
      //当左指针指向的元素比主元大且右指针指向的元素比主元少，并且左指针索引没有右指针索引大
      // 意思当左项比右项大
      if (i <= j) {
        [array[i], array[j]] = [array[j], array[i]]
        i++
        j--
      }
    }
    index = i
    if (left < index - 1) {
      quick(array, left, index -1)
    }
    if (index < right) {
      quick(array, index, right)
    }
  }
}
</script>


<script id="jsbin-source-javascript" type="text/javascript">let quickSort = function (array) {
  quick(array, 0, array.length - 1)
}

let quick = function (array, left, right) {
  var index
  if (array.length > 1) {
    var pivot = array[Math.floor((right + left)/2)],
        i = left,
        j = right;
    for (;i <= j;) {
      while (array[i] < pivot) {
        i++
      }
      while (array[j] > pivot) {
        j--
      }
      //当左指针指向的元素比主元大且右指针指向的元素比主元少，并且左指针索引没有右指针索引大
      // 意思当左项比右项大
      if (i <= j) {
        [array[i], array[j]] = [array[j], array[i]]
        i++
        j--
      }
    }
    index = i
    if (left < index - 1) {
      quick(array, left, index -1)
    }
    if (index < right) {
      quick(array, index, right)
    }
  }
}</script></body>
</html>

## jsbin.vurokef.js
let quickSort = function (array) {
  quick(array, 0, array.length - 1)
}

let quick = function (array, left, right) {
  var index
  if (array.length > 1) {
    var pivot = array[Math.floor((right + left)/2)],
        i = left,
        j = right;
    for (;i <= j;) {
      while (array[i] < pivot) {
        i++
      }
      while (array[j] > pivot) {
        j--
      }
      //当左指针指向的元素比主元大且右指针指向的元素比主元少，并且左指针索引没有右指针索引大
      // 意思当左项比右项大
      if (i <= j) {
        [array[i], array[j]] = [array[j], array[i]]
        i++
        j--
      }
    }
    index = i
    if (left < index - 1) {
      quick(array, left, index -1)
    }
    if (index < right) {
      quick(array, index, right)
    }
  }
}
	<!DOCTYPE html>
	<html>
	<head>
	<meta charset="utf-8">
	<meta name="viewport" content="width=device-width">
	<title>JS Bin</title>
	</head>
	<body>

	<script id="jsbin-javascript">
	let quickSort = function (array) {
	quick(array, 0, array.length - 1)
	}

	let quick = function (array, left, right) {
	var index
	if (array.length > 1) {
	var pivot = array[Math.floor((right + left)/2)],
	i = left,
	j = right;
	for (;i <= j;) {
	while (array[i] < pivot) {
	i++
	}
	while (array[j] > pivot) {
	j--
	}
	//当左指针指向的元素比主元大且右指针指向的元素比主元少，并且左指针索引没有右指针索引大
	// 意思当左项比右项大
	if (i <= j) {
	[array[i], array[j]] = [array[j], array[i]]
	i++
	j--
	}
	}
	index = i
	if (left < index - 1) {
	quick(array, left, index -1)
	}
	if (index < right) {
	quick(array, index, right)
	}
	}
	}
	</script>



	<script id="jsbin-source-javascript" type="text/javascript">let quickSort = function (array) {
	quick(array, 0, array.length - 1)
	}

	let quick = function (array, left, right) {
	var index
	if (array.length > 1) {
	var pivot = array[Math.floor((right + left)/2)],
	i = left,
	j = right;
	for (;i <= j;) {
	while (array[i] < pivot) {
	i++
	}
	while (array[j] > pivot) {
	j--
	}
	//当左指针指向的元素比主元大且右指针指向的元素比主元少，并且左指针索引没有右指针索引大
	// 意思当左项比右项大
	if (i <= j) {
	[array[i], array[j]] = [array[j], array[i]]
	i++
	j--
	}
	}
	index = i
	if (left < index - 1) {
	quick(array, left, index -1)
	}
	if (index < right) {
	quick(array, index, right)
	}
	}
	}</script></body>
	</html>