Computer scienceAlgorithms and Data StructuresAlgorithmsArray algorithmsSorting algorithms

Bubble sort

Bubble statements

Report a typo

Select the correct statement about bubble sort.

Select one option from the list

The algorithm is very efficient for sorting small and large arrays.

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

The algorithm needs an additional array to store intermediate results.

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.

___

Create a free account to access the full topic