Bubble Sort

This lecture introduces the bubble sort algorithm, explaining its concept of comparing and swapping elements in an array to sort them in ascending order. The instructor walks through the process using a sample array, detailing each iteration cycle and the resulting sorted elements. The lecture concludes with a preview of the next session, which will include graphical visualization of the algorithm.

What happens to the sorted and unsorted parts of the array as the bubble sort progresses?

Why is the algorithm called 'bubble sort'?