Sort an array of 0s and 1s

• Use two pointers, one at the beginning and one at the end

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

• Time complexity: O(n)