Intuitive $O(n\, \text{log}(n))$ example

26 Views Asked by At

I'm having a hard time getting the intuition of an algorithm with worst-case complexity $O(n\,\text{log}(n))$. Is any informative example available?