Time complexity doubt

[rahulmishra6830 (null null)]

quicksort complexity is o(nlogn) or n sq because both are written on the net.
which one is correct?