$1.$ Scan p from right to left until an element is found that is less than its neighbor to the right. Call the

index position of this element i$.$

$2.$ Scan again from right to left until an element is found that is greater than the one at i$.$ Call the position

of this element j$.$

$3.$ Exchange the i

th and j

th elements.

$4.$ Reverse the elements from the $($i $+1)$st position to the right.