1. Illustrate the operation of the above algorithm on the array A = {37, 45, 69, 26, 45, 55}.

2. Why does it need to run for only the first n - 1 elements, rather than for all n elements for outer loop?

3. What is the best case running time of the above algorithm?

4. What is the worst case running time of the above algorithm?

5. How can we modify the above algorithm to have a good best-case running time? (i.e. Terminate the algorithm as soon as the list is sorted.)

Boolean issorted; for i = 1 to A: length -1 IsSorted = true; for j = A: length downto i + 1 if A[j]