Bubble sort is a simple sorting algorithm that works by repeatedly comparing adjacent pairs of elements and swapping them if they are in the wrong order. It is a comparison-based algorithm with a worst-case and average time complexity of O(n^2), occurring when the array is reverse sorted. The best-case time complexity is O(n) when the array is already sorted. The algorithm sorts the array 8 9 6 1 3 4 7 by repeatedly swapping adjacent elements that are out of order.

1. Bubble sort

2. Definition
• Bubble Sort is the simplest sorting algorithm
that works by repeatedly swapping the
adjacent elements if they are in wrong order.
• This sorting algorithm is comparison-based
algorithm.

3. Algorithm

4. Bubble sort

12. • Worst and Average Case Time
Complexity: O(n*n). Worst case occurs when
array is reverse sorted.
• Best Case Time Complexity: O(n). Best case
occurs when array is already sorted.

13. Advantages

14. Disadvantages

15. Activity
• 8 9 6 1 3 4 7 - Sort using bubble sort