QuickSort

gistfile1.js

function swap(items, firstIndex, secondIndex){
    var temp = items[firstIndex];
    items[firstIndex] = items[secondIndex];
    items[secondIndex] = temp;
}

 function partition(items, left, right){
 	var pointer = Math.floor((left+right)/2);
 	var i = left;
 	var j = right;

 	while(i<=j){

 		while(items[i] < items[pointer]) {
 			i++;
 		};

 		while(items[pointer] < items[j]) {
 			j--;
 		}

 		if(i <= j) {
 			swap(items, i, j);
 			i++;
 			j--;
 		}
 	}

	return i;		

 }

 function quickSort(items, left, right){

 	var index;

 	if(items.length > 1){
 		index = partition(items, left, right); 
		 				
		if(left < index-1){
			quickSort(items, left, index-1);
		};

		if(index < right){
			quickSort(items, index, right);
		}

 	}
 	return items;
 }



var arr = [4,2,6,5,3,9];
console.log("array", arr);
var result = quickSort(arr, 0, arr.length - 1);
console.log("sorted array", arr);