Given an array with objects colored red, white, or blue, sort them so those of the same color are adjacent. Use integers 0, 1, 2 to represent RWB respectively.

This problem can be efficiently solved using the Dutch National Flag algorithm. This algorithm sorts the array in-place using three pointers: low, mid, and high.

1. Initialize low to 0, mid to 0, and high to the end of the array.
2. Iterate while mid is less than or equal to high:
   • If the element at mid is 0 (red), swap it with the element at low and increment both low and mid.
   • If the element at mid is 1 (white), simply increment mid.
   • If the element at mid is 2 (blue), swap it with the element at high and decrement high.

This approach ensures that all 0s are moved to the beginning, all 1s to the middle, and all 2s to the end, achieving the desired sorted order in a single pass.