Computer scienceAlgorithms and Data StructuresAlgorithmsArray algorithmsSorting algorithms

Bubble sort

Facts on bubbles

Report a typo

Which of the following statements are true about bubble sort?

Select one or more options from the list

The algorithm is stable.

The worst-case time complexity is Ο(n log n) where n is the array length.

If an array must be sorted in the ascending order, the wrong order is the case when the previous element is greater than the next one.

The algorithm needs an additional array of the same size as the input array.

___

Create a free account to access the full topic