recurrence equation that describes the running time of quicksort when assuming that the pivot is always placed in the middle of the array
T(N)=T(N/2)+ N T(N)=2*T(N/2)+N none of the others T(N)=T(N/2)+ 1 T(N)=2*T(N/2) + 1