js: quicksort

quicksort.js

function quick_sort(a) {

	var m = a.length;

	if(m <= 1) return a;

	var v = a.shift();
	var l = [];
	var r = [];

	for(var i = 0; i < m - 1; i++) {
		if(a[i] <= v) l.push(a[i])
		else r.push(a[i]);
	}

	return quick_sort(l).concat([v].concat(quick_sort(r)));

}