Write a description of bubble sort in programming, give the steps to follow, keep it short

Bubble Sort is a simple sorting algorithm in programming. It works by repeatedly swapping the adjacent elements if they are in the wrong order. Here are the steps:

1. Start from the first element, compare it with the next element.
2. If the first element is greater than the next, swap them.
3. Move to the next pair of elements and repeat the process.
4. Continue this until you make a pass through the list without making any swaps. At this point, the list is sorted.

This process is called a pass. During each pass, the largest element bubbles up to its correct position, hence the name "Bubble Sort".