Which optimized sorting/searching pattern solves this lesson cleanly?

Question

Which optimized sorting/searching pattern solves this lesson cleanly?

Option A — Correct answer

Rightmost pivot, swap with next larger, then reverse suffix.

Option B

Plain nested loops without using order

Option C

Recursive DFS on tree nodes

Option D

Character frequency counting only

Explanation

Rightmost pivot, swap with next larger, then reverse suffix.

Next Permutation - Pivot and Suffix Reversal Pattern Practice Quiz