Introduction to Sorting Algorithms: Bubble Sort

Introduction to Bubble Sort

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. The pass through the list is repeated until the list is sorted.

Step 1: Understanding the Algorithm

The Bubble Sort algorithm works by repeatedly swapping the adjacent elements if they are in the wrong order.

Step 2: Implementing the Algorithm in Python

def bubble_sort(arr):
    n = len(arr)
    for i in range(n):
        for j in range(0, n - i - 1):
            if arr[j] > arr[j + 1] :
                arr[j], arr[j + 1] = arr[j + 1], arr[j]
    return arr
## Step 3: Testing the Algorithm
```python
arr = [64, 34, 25, 12, 22, 11, 90]
print("Original array:", arr)
print("Sorted array:", bubble_sort(arr))

Output

Original array: [64, 34, 25, 12, 22, 11, 90]
Sorted array: [11, 12, 22, 25, 34, 64, 90]

Conclusion

In this tutorial, we learned the basics of the Bubble Sort algorithm and implemented it in Python. This is a beginner-friendly algorithm and is a good starting point for learning more complex sorting algorithms.