Sort an array containing 0, 1, and 2.

• Use a sorting algorithm like quicksort or mergesort.

• Count the occurrences of 0s, 1s, and 2s, then reconstruct the array.

• Use three pointers to keep track of the pos...read more