Variations on a theme by Quicksort

quicksort.js

//Recursive Quicksort using Lomuto's partitioning method
function lomutosPartition(array, start, end) {
	let i = start;
	let pivot = array[end]

	for(let j = start; j < end; j++) {
		if(pivot > array[j]) {
			[array[j], array[i]] = [array[i], array[j]];
			i++;
		}
	}

	[array[i], array[end]] = [array[end], array[i]]

	return i;
}

function quickLomuto(array, start, end) {
	if(end - start <= 1) {
		return;
	}

	let pivotIndex = lomutosPartition(array, start, end)
	
	quickLomuto(array, pivotIndex + 1, end)
	quickLomuto(array, start, pivotIndex - 1)

}