quicksort.js

function quicksort(a) {
	if (a.length == 0) return [];

	var great = [], less = [], pivot = a[0];

	for (i=1; i<a.length; i++){

		if (a[i]>pivot)
			great.push(a[i]);
		else {
			less.push(a[i]);}
	
	}

	return quicksort(less).concat(pivot,quicksort(great));
}

yeah, i corrected it-- seems like i missed some {}