Chapter 14, Problem 21RE

Explanation of Solution

Big-Oh efficiency of the algorithm:

• The give algorithm contains two nested loop and its running time will be $\text{O}\left({\text{n}}^2\right)$.
• The inner loop must compare each pair of the adjacent element and which operation will be in $\text{O}\left(\text{n}\right)$