Bubble sort implementation with js

 1.

function bubbleSort(arr) { const len = arr.length; let swapped; do { swapped = false; for (let i = 0; i < len - 1; i++) { if (arr[i] > arr[i + 1]) { // Swap elements [arr[i], arr[i + 1]] = [arr[i + 1], arr[i]]; swapped = true; } } } while (swapped); return arr; } // Example usage: const array = [5, 3, 8, 2, 1, 4]; console.log("Original array:", array); console.log("Sorted array:", bubbleSort(array));

2.

function bubbleSort(arr) { const len = arr.length; for (let i = 0; i < len - 1; i++) { for (let j = 0; j < len - 1 - i; j++) { if (arr[j] > arr[j + 1]) { // Swap elements [arr[j], arr[j + 1]] = [arr[j + 1], arr[j]]; } } } return arr; } // Example usage: const array = [5, 3, 8, 2, 1, 4]; console.log("Original array:", array); console.log("Sorted array:", bubbleSort(array));