Sort an array of 0s, 1s, and 2s in linear time complexity.

• Use three pointers to keep track of the positions of 0s, 1s, and 2s.

• Traverse the array and swap elements to their respective positions.

• Time co...read more