overview
Bubble Sort repeatedly swaps adjacent elements if they are in the wrong order, gradually moving the largest element to its correct position.
time complexity
BestCase: O(n) - when the array is already sorted.
AverageCase: O(n^2)
WorstCase when the array is sorted in reverse order
Space complexity
O(1)