Algoritmos de Ordenamiento

function bubbleSort(array) {
    for (let i = 0; i < array.length; i++) {
        for (let j = 0; j < array.length - 1; j++) {
            if (array[j] > array[j + 1]) {
                [array[j], array[j + 1]] = [array[j + 1], array[j]];
            }
        }
    }
    return array;
}

function quickSort(array) {
    if (array.length <= 1) return array;
    let pivot = array[0];
    let izq = array.slice(1).filter(x => x <= pivot);
    let der = array.slice(1).filter(x => x > pivot);
    return [...quickSort(izq), pivot, ...quickSort(der)];
}

function mergeSort(array) {
    if (array.length <= 1) return array;
    let medio = Math.floor(array.length / 2);
    let izq = mergeSort(array.slice(0, medio));
    let der = mergeSort(array.slice(medio));
    return merge(izq, der);
}