lesson1Title

lesson2Title

lesson3Title

lesson4Title

lesson5Title

lesson6Title

lesson7Title

lesson8Title

lesson9Title

lesson10Title

lesson11Title

lesson12Title

pythonIntroAlgorithms1Chapter2Title

lesson13Title

lesson14Title

lesson15Title

lesson16Title

lesson17Title

lesson18Title

lesson19Title

pythonIntroAlgorithms1Chapter1Title

pythonIntroAlgorithms1Chapter3Title

pythonIntroAlgorithms1Chapter4Title

# What is Bubble Sort?

Bubble sort is a straightforward sorting method that involves comparing two adjacent elements and sending the larger one to the back.

<br />

## Key Features

- `Adjacent Element Comparison`: It sequentially compares adjacent elements for sorting.

- `Swap After Comparison`: If adjacent elements are not in the desired order, they are swapped.

- `Repetition`: The entire array is iterated multiple times for sorting.

- `Poor Time Complexity (O(n²))`: Bubble sort is a somewhat inefficient sorting method with a time complexity proportional to the square of the number of elements.