Bubble Sort is a __ sorting algorithm that repeatedly compares adjacent elements and swaps them if they are in the wrong order.

The algorithm continues to iterate through the list until a pass is made without any __.

The time complexity of Bubble Sort is __ in the worst case, where n is the number of elements in the list.

The best case time complexity of Bubble Sort is __, which occurs when the list is already sorted.