Sort an array of 0s and 1s with low complexity.

• Use two pointers, one at the beginning and one at the end of the array.

• Swap 0s from the beginning with 1s from the end until the pointers meet.

• Time compl...read more