Bubble Sort Algorithm in DSA Javascript - Build from Scratch

Bubble Sort Algorithm

📖 Scenario: You have a list of numbers that you want to arrange from smallest to largest, like sorting books by height on a shelf.

🎯 Goal: Build a program that sorts a list of numbers using the Bubble Sort method, which compares pairs of numbers and swaps them if they are in the wrong order.

📋 What You'll Learn

Create an array called numbers with the exact values: [5, 3, 8, 4, 2]

Create a variable called n that stores the length of the numbers array

Use nested for loops with variables i and j to perform the Bubble Sort algorithm

Swap elements in the numbers array when the current element is greater than the next element

Print the sorted numbers array at the end

💡 Why This Matters

🌍 Real World

Sorting is used everywhere, like organizing contacts by name or arranging products by price in online stores.

💼 Career

Understanding sorting algorithms helps in software development, data analysis, and improving program efficiency.

1

Create the initial array

Create an array called numbers with these exact values: [5, 3, 8, 4, 2]

DSA Javascript

// Create the array called numbers with the values [5, 3, 8, 4, 2]
// Your code here

Hint

Use const numbers = [5, 3, 8, 4, 2]; to create the array.

2

Set up the length variable

Create a variable called n that stores the length of the numbers array

DSA Javascript

const numbers = [5, 3, 8, 4, 2];
// Create a variable n that stores the length of numbers
// Your code here

Hint

Use const n = numbers.length; to get the array length.

3

Implement the Bubble Sort loops

Use nested for loops with variables i and j to perform Bubble Sort on the numbers array. Swap elements when numbers[j] is greater than numbers[j + 1].

DSA Javascript

const numbers = [5, 3, 8, 4, 2];
const n = numbers.length;
// Add nested for loops with i and j to sort numbers using Bubble Sort
// Your code here

Hint

Use two for loops: outer loop with i from 0 to n-1, inner loop with j from 0 to n-1-i. Swap elements if numbers[j] is greater than numbers[j+1].

4

Print the sorted array

Print the numbers array after sorting using console.log(numbers)

DSA Javascript

const numbers = [5, 3, 8, 4, 2];
const n = numbers.length;
for (let i = 0; i  numbers[j + 1]) {
            const temp = numbers[j];
            numbers[j] = numbers[j + 1];
            numbers[j + 1] = temp;
        }
    }
}
// Print the sorted numbers array
// Your code here

Hint

Use console.log(numbers); to print the sorted array.