JS sort algorithm

bubbleSort.js

function bubbleSort(arr) {
	for (var i = 0; i < arr.length - 1; i++) {
		for (var j = 0; j < arr.length - 1 - i; j++) {
			if (arr[j] > arr[j+1]) {
				var temp = arr[j];
				arr[j] = arr[j+1];
				arr[j+1] = temp;
			}
		}
	}
	return arr;
}

insertSort.js

function insertSort (arr) {
	for (var i = 1; i < arr.length; i++) {
		var temp = arr[i];
		var prev = i - 1;
		while (temp < arr[prev] && prev >= 0) {
			arr[prev + 1] = arr[prev];
			arr[prev] = temp;
			prev--;
		}
	}
	return arr;
}

quickSort.js

function quickSort(arr) {
	if (arr.length < 2) return arr;
	var pivotIndex =  Math.floor(arr.length / 2);
	var pivot = arr.splice(pivotIndex, 1);
	var left = [],
	    right = [];
    for (var i = 0; i < arr.length; i++) {
    	if (arr[i] < pivot) {
    		left.push(arr[i]);
    	} else {
    		right.push(arr[i]);
    	}
    }
    return quickSort(left).concat(pivot, quickSort(right));
}