The following is the pseudocode for which type of algorithm? For maxElement = each subscript in the array, from the last to the first For index = 0 To maxElement - 1 If array[index] > array[index + 1] swap array[index] with array[index + 1] End If End For End For
Bubble sort is an algorithm that is used for sorting numbers. This algorithm provides a comparative method that compares each couple of identical elements and swaps elements if they're not in order.
It will not work for big data sources.
Its avg complexity and the worst case is O(n2) not work for big data. In O(n2), n is related to the number of objects.
