Question

How to implement the bubble sort algorithm in JavaScript

Answer 1

function bubbleSort(arr) { 
    let i = 0, j;  
       
    while (i < arr.length) {  
        j = i + 1;  
        while (j < arr.length) { 
            if (arr[j] < arr[i]) { 
                let tmp = arr[i];  
                arr[i] = arr[j];  
                arr[j] = tmp;  
            }  
            j++;  
        }  
        i++;  
    }  
}  
 
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