Быстрая сортировка числового ряда на месте (JavaScript)

quickSort.js

function quickSort(array) {
	if (array.length < 2) {
		return array
	}

	quickSortMaster(0, array.length - 1)

	return array

	function quickSortMaster (left, right) {
		const pivot = array[Math.floor((right + left) / 2)]

		let l = left
		let r = right

		while (l <= r) {
			while (array[l] < pivot) {
				l++
			}

			while (array[r] > pivot) {
				r--
			}

			if (l <= r) {
				[array[r], array[l]] = [array[l], array[r]]

				l++
				r--
			}
		}

		if (left < l - 1) {
			quickSortMaster(left, l - 1);
		}

		if (l < right) {
			quickSortMaster(l, right);
		}
	}
}

Пруфы

https://repl.it/@Aleksey_Danchin/BitesizedGregariousCharacterencoding