Question

How to implement the bubble sort algorithm using map in JavaScript

Answer 1

function bubbleSort(arr) { 
		arr.map(el1 => arr.map((el2, i) => {
        if (arr[i] > arr[i + 1]) {
            arr[i] = arr[i + 1];
            arr[i + 1] = el2;
        }
    }))
    return arr;
}  
 
const arr = [4, 8, 2, 11, 9, 7, 3, 1]; 
 
bubbleSort(arr);
   
console.log(arr);
 
 

 
/*
run:
 
[1, 2, 3, 4, 7, 8, 9, 11]
 
*/

 

70+ SQL courses for beginners and professionals

Answer 2

function bubbleSort(arr) { 
		arr.map(el1 => arr.map((el2, i) => {
        if (arr[i] > arr[i + 1]) {
            [arr[i], arr[i + 1]] = [arr[i + 1], arr[i]];
        }
    }))
    return arr;
}  
 
const arr = [4, 8, 2, 11, 9, 7, 3, 1]; 
 
bubbleSort(arr);
   
console.log(arr);
 
 
 

 
/*
run:
 
[1, 2, 3, 4, 7, 8, 9, 11]
 
*/

 

70+ SQL courses for beginners and professionals