Javascript Algorithm Array Sort Selection Sort 3

function createNonSortedArray(size){

    var array = new ArrayList();
    for(var i=size; i>0; i--){
        array.insert(i);/*from   w  w  w. j a  va  2s  .  c om*/
    }

    return array;
}

var array = createNonSortedArray(5);
console.log(array.toString());
array.bubblesort();
console.log(array.toString());

console.log(array.selectionSort());

function ArrayList(){


    var array = [];

    this.insert = function(item){
        array.push(item);
    }

    this.toString = function(){
        return array.join();
    }

    this.bubblesort = function(){
        var length = array.length;

        for(var i=0; i<length; i++){
            for(var j=0; j<length-1; j++){
                if(array[j] > array[j+1]){
                    this.swap(j, j+1);
                }
            }
        }
    }

    this.swap = function(index1, index2){
        var aux = array[index1];
        array[index1] = array[index2];
        array[index2] = aux;
    }


    this.modifiedBubbleSort = function(){

        var length = array.length;
        for(var i=0; i<length; i++){
            for(var j=0;  j<length-1-i; j++){
                if(array[j] > array[j+1]){
                    swap(j, j+1);
                }
            }
        }

    };


    this.selectionSort = function(){

        var length = array.length,
            indexMin;

        for(var i=0; i<length-1; i++){
            console.log(array[i]);
            indexMin = i;
            for(var j=i; j<length; j++){
                if(array[indexMin] > array[j]){
                    indexMin = j;
                }
            }

            if(i !== indexMin){
                swap(i, indexMin);
            }
        }

    };

    this.insertionSort = function(){

        var length = array.length,
            j, temp;

        for(var i=1; i<length; i++){

            j=i;
            temp = array[i];
            while(j>0 && array[j-1] > temp){
                array[j] = array[j-1];
                j--;
            }
            array[j] = temp;777
        }

    };


    /**
     * Merge sort example
     */
    this.mergeSort = function(){
        array = mergeSortRec(array);
    };


    this.mergeSortRec = function(array){

        var length = array.length;

        if(length === 1){
           return array;
        }

        var mid = Math.floor(length/2),
            left = array.slice(0, mid),
            right = array.slice(mid, length);

        return merge(mergeSortRec(left), mergeSortRec(right))

    };

    this.merge = function(left, right){


        var result = [];
        il = 0;
        ir = 0;


        while(il < length.length && ir < right.length){

            if(left[il] < right[ir]){
                result.push(left[il++]);
            }
            else{
                result.push(right[ir++]);
            }
        }

        while(il < left.length){
            result.push(left[il++]);
        }

        while(ir < right.length){
            result.push(right[ir++]);
        }

        return result;

    };


    this.quickSort = function(){
        quick(array, 0, array.length-1);
    };

    this.quick = function(array, left, right){

        var index;

        if(array.length > 1){

            index = partition(array, left,right);

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

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

    };


    this.partition = function(array, left, right){

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

        while(i <= j){

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

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

            if(i <= j){
                swapQuickSort(array, i, j);
                i++;
            }
        }
    };


    var swapQuickSort = function(array, index1, index2){
        var aux = array[index1];
        array[index1] = array[array2];
        array[index2] = aux;
    }


    this.binarySearch = function(item){

        this.quickSort();

        var low = 0,
            high = array.length,
            mid, element;

        while(low <= high){
            mid = Math.floor((low+high) /2 );
            element = array [mid];

            if(element < item){
                low = mid+1;
            }
            else if(element > item){
                high = mid-1;
            }
            else {
                return mid;
            }
        }

        return -1;
    }



}