Write the slowest possible terminating algorithm you can think of to sort a list of integers in increasing order. You must not use any infinite or idle loop.

Ex of what it should sort of look like:

procedure bubblesort(a₁,...,a_n : real numbers with n => 2) for i := 1 to n - 1 for j := 1 to n - i if a_j > a_j+1 then interchange a_j and a_j+1

_{Explain how the algorithm is really slow.}

Show a step by step demonstration of how the algorithm works with a made up list.

Thanks! any explaining is also welcomed!