Sorting an array of boolean values
With only 2 possible values, you want to use an algorithm such as Counting Sort. 

Since you only have 2 possible values, true and false, it's easy to just count how many true/false values you have. But to be more efficient, you can just count how many trues you have (or falses) instead. Because size - numTrue = numFalse.