Compare different partition schemes in quick sort (Lomuto vs Hoare).

Lomuto partition uses a single pointer, placing pivot at end, and scans left-to-right swapping elements smaller than pivot. Simpler but does more swaps. Hoare partition uses two pointers moving inward, swapping when they find pair out of order - fewer swaps (3x fewer on average), handles duplicates better, but pivot doesn't end at final position. Hoare is generally faster but Lomuto is easier to implement and modify.