I would like to know how many comparisons, in the worst case, does Quicksort need to sort an binary array of size `n`.  

I can't find out what the worst case for this problem. `[0 1 0 1 0 1..]` ?  

Cheers,  

eo