Example of Big Theta(n log n) Algorithm

Hi,
I need to give an example of an iterative algorithm with running time Big Theta(n log n).
I'm thinking about using Heapsort. I know it's Big O is (n log n), but I'm not sure about its Big Theta.
Is it also n log-n ?