If a sorting algorithm method guarantees that elements preceding a 'pivot' are always less than the pivot, which consequence follows?

A)Algorithm achieves O(n^3) time complexity

B)Pivot is in its final sorted position✓

C)Algorithm becomes unstable for duplicates

D)Requires infinite memory for temporary storage

💡 Explanation

Because the method places all elements smaller than the pivot to the left, the pivot is therefore in its correct sorted position. This is guaranteed by the partitioning mechanism. This outcome occurs, rather than others, due to the invariant property established by the method.

🏆 Up to £1,000 monthly prize pool

Ready for the live challenge? Join the next global round now.
*Terms apply. Skill-based competition.

⚡ Enter Arena

If a sorting algorithm method guarantees that elements preceding a 'pivot' are always less than the pivot, which consequence follows?

💡 Explanation

Related Questions