DSA Tutorial

🧠 Imagine bubbles rising in water — smaller bubbles "bubble up" to the top by swapping with larger ones!

⚙️ How It Works

• Compare adjacent elements
• If the left element is greater, swap them
• Repeat for the entire array, multiple times

🔍 Example

Original Array: [5, 3, 1, 4]

• Compare 5 and 3 → Swap → [3, 5, 1, 4]
• Compare 5 and 1 → Swap → [3, 1, 5, 4]
• Compare 5 and 4 → Swap → [3, 1, 4, 5]
• Repeat the process again until sorted → [1, 3, 4, 5]

💻 C Code Example

#include <stdio.h>

void bubbleSort(int arr[], int n) {
    for (int i = 0; i < n-1; i++) {
        for (int j = 0; j < n-i-1; j++) {
            if (arr[j] > arr[j+1]) {
                // swap
                int temp = arr[j];
                arr[j] = arr[j+1];
                arr[j+1] = temp;
            }
        }
    }
}

int main() {
    int a[] = {5, 3, 1, 4};
    int n = 4;
    bubbleSort(a, n);
    for (int i = 0; i < n; i++) {
        printf("%d ", a[i]);
    }
    return 0;
}
    

⏱️ Time Complexity: O(n²) in worst and average case
✅ Best Case: O(n) (when array is already sorted)
🔁 Stable: Yes

💡 Use Bubble Sort only for small datasets or learning purposes. It's not efficient for large data.