Lista de algoritmos úteis em javascript: quicksort,...

quick-sort.js

function partition( array, left, right ) {
	var	pivot = array[Math.floor((left + right)/2)],
		i 	  = left,
		j 	  = right;

	
	while ( i <= j ) {

		while ( array[i] <  pivot ) {
			i++;
		}

		while ( array[j] >  pivot ) {
			j--;
		}

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

function swap( array, leftIndex, rightIndex ) {
	var left = array[leftIndex],
		right = array[rightIndex];

	array[leftIndex] = right;
	array[rightIndex] = left;
}

function quickSort( array, left, right ) {

    var index;

    if (array.length > 1) {

        index = partition(array, left, right);

        if (left < index - 1) {
            quickSort(array, left, index - 1);
        }

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

    }

    return array;
}

var array = [4,2,6,5,3,9] || ['mario','luan', 'santos', 'de', 'souza'];
var result = quickSort(array, 0, array.length - 1);
console.log(result);