Bubble Sort Algorithm

Bubble Sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order. It is easy to understand but not efficient for large data.

How It Works

• Compare two adjacent elements
• Swap if they are in the wrong order
• Repeat until array is sorted
• Worst Time Complexity: O(n²)

Code Example

for(int i = 0; i < n-1; i++){
  for(int j = 0; j < n-i-1; j++){
    if(arr[j] > arr[j+1]){
      int t = arr[j];
      arr[j] = arr[j+1];
      arr[j+1] = t;
    }
  }
}

Expected Output

When to Use

• Learning basic sorting concepts
• Very small datasets
• Not recommended for large arrays