Sorting Algorithms.
Analysis Time Complexity: Best Case: O(n) — When the array is already sorted and no swaps are needed. Worst Case: O(n²) — When the array is sorted in reverse order. Average Case: O(n²) — On average, bubble sort requires n² comparisons and swaps. Space Complexity: Bubble sort is an in-place sorting