What does the algorithm accomplish? Calculate the worst-case running time of the algorithm using Big-Oh notation. Indicate how you arrived at the answer.

Question

function array question_1 (array, array_length)

temp = zeros (1,'uint16');

for amount = 1 : (array_length-1)

for position = 1 : (array_length-1)

if array (position) <array (position+1)

temp = array (position);

array (position) = array (position+1);

array (position+1) = temp;

end

end

end

end

Answer 1

looks like bubble sort

which is O(n^2)