SortngAlgorithms.js

var array = [];
var count = 0;

// function bubbleSort(arr) {
//     var n = arr.length;
//     count = 0;

//     for (var i = 0; i < n - 1; i++) {
//         for (var j = 0; j < n - i - 1; j++) {
//             if (arr[j] > arr[j + 1]) {
//                 // Swap arr[j] and arr[j + 1]
//                 var temp = arr[j];
//                 arr[j] = arr[j + 1];
//                 arr[j + 1] = temp;
//                 //console.log(`${count} : ${JSON.stringify(arr)}`);
//             }
//             //count++;
//         }
//     }
//     return arr;
// }

// //Example usage
// console.log(`--bubbleSort--`);
// array = [64, 34, 25, 12, 22, 11, 90];
// //array = [90, 64, 34, 25, 22, 12, 11];
// //console.log(`0 + ${JSON.stringify(array)}`);
// console.log(bubbleSort(array));

function selectionSort(arr) {
    var n = arr.length;
    count = 0;
    for (var i = 0; i < n - 1; i++) {
        var minIdx = i;
        for (var j = i + 1; j < n; j++) {
            if (arr[j] < arr[minIdx]) {
                minIdx = j;
            }
            count++;
        }
        // Swap arr[i] and arr[minIdx]
        var temp = arr[minIdx];
        arr[minIdx] = arr[i];
        arr[i] = temp;

        console.log(`${count} + ${JSON.stringify(arr)}`);
    }
    return arr;
}

// Example usage
console.log(`--SelectionSort--`);
//array = [64, 25, 12, 22, 11];
array = [89, 29, 5, 35];
console.log(`0 + ${JSON.stringify(array)}`);
console.log(selectionSort(array));


function insertionSort(arr) {
    var n = arr.length;
    for (var i = 1; i < n; i++) {
        var key = arr[i];
        var j = i - 1;
        while (j >= 0 && arr[j] > key) {
            arr[j + 1] = arr[j];
            j = j - 1;
            count++;
        }
        arr[j + 1] = key;
        console.log(`${count} + ${JSON.stringify(arr)}`);
    }
    return arr;
}

// Example usage
console.log(`--InsertionSort--`);
//array = [12, 11, 13, 5, 6];
array = [90, 64, 34, 25, 22, 12, 11];
console.log(`0 + ${JSON.stringify(array)}`);
console.log(insertionSort(array));

function mergeSort(arr) {
    if (arr.length <= 1) {
        return arr;
    }

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

    return merge(mergeSort(left), mergeSort(right));
}

function merge(left, right) {
    var result = [];
    var leftIndex = 0;
    var rightIndex = 0;

    while (leftIndex < left.length && rightIndex < right.length) {
        if (left[leftIndex] < right[rightIndex]) {
            result.push(left[leftIndex]);
            leftIndex++;
        } else {
            result.push(right[rightIndex]);
            rightIndex++;
        }
    }

    return result.concat(left.slice(leftIndex)).concat(right.slice(rightIndex));
}

// Example usage
array = [12, 11, 13, 5, 6, 7];
console.log(mergeSort(array));


function quickSort(arr) {
    if (arr.length <= 1) {
        return arr;
    }

    var pivot = arr[arr.length - 1];
    var left = [];
    var right = [];

    for (var i = 0; i < arr.length - 1; i++) {
        if (arr[i] < pivot) {
            left.push(arr[i]);
        } else {
            right.push(arr[i]);
        }
    }

    return quickSort(left).concat(pivot, quickSort(right));
}

// Example usage
array = [10, 7, 8, 9, 1, 5];
console.log(quickSort(array));