02-UsingSortingAlgorithms.js

function createNonSortedArray(size){
    var array = new ArrayList();

    for (var i = size; i> 0; i--){
        array.insert(i);
    }

    return array;
}

function createRandomNonSortedArray(){
    var array = new ArrayList();

    array.insert(3);
    array.insert(5);
    array.insert(1);
    array.insert(6);
    array.insert(4);
    array.insert(7);
    array.insert(2);

    return array;
}

function printArray(array){
    console.log(array.toString());
}

function createNonSortedArrayAndPrint(size){
    var array = createNonSortedArray(size);
    printArray(array);

    return array;
}

console.log('********** Bubble Sort **********');

var array = createNonSortedArrayAndPrint(5);

array.bubbleSort();

printArray(array);

console.log('********** Modified Bubble Sort **********');

array = createNonSortedArrayAndPrint(5);

array.modifiedBubbleSort();

printArray(array);

console.log('********** Selection Sort **********');

array = createNonSortedArrayAndPrint(5);

array.selectionSort();

printArray(array);

console.log('********** Insertion Sort **********');

array = createNonSortedArrayAndPrint();

array.insertionSort();

printArray(array);

console.log('********** Merge Sort **********');

array = createNonSortedArrayAndPrint(8);

array.mergeSort();

printArray(array);

console.log('********** Quick Sort **********');
array = createRandomNonSortedArray();

printArray(array);

array.quickSort();

printArray(array);

console.log('********** Heap Sort **********');
array = createRandomNonSortedArray();

printArray(array);

array.heapSort();

printArray(array);


console.log('********** Counting Sort **********');

array = createNonSortedArrayAndPrint(8);

array.countingSort();

printArray(array);

console.log('********** Bucket Sort **********');

array = createNonSortedArrayAndPrint(8);

array.bucketSort(3);

printArray(array);