Intuitive explanation for why QuickSort is n log n?

Question

Is anybody able to give a \'plain english\' intuitive, yet formal, explanation of what makes QuickSort n log n? From my understanding it has to make a pass over n items, and

Answer 1

In-fact you need to find the position of all the N elements(pivot),but the maximum number of comparisons is logN for each element (the first is N,second pivot N/2,3rd N/4..assuming pivot is the median element)