Describe an efficient algorithm to sort an array of size n consisting of numbers {0, 1, 2} where you can only use one additional space (array element).