The average and worst-case time complexity of bubble sort algorithm is .

In bubble sort algorithm, the largest element is moved to the end of the array in each .

In Bubble Sort, the element 'bubbles up' to its correct position in each pass.

In Bubble Sort, we compare adjacent pairs of elements and swap them if they are in the order.

Bubble Sort is an example of a sort algorithm.