Average time of quick sort is O(nlogn). So in many contest n is like 5*10^5 at that time nlogn would be ~10^7 operations. Considering not worst but some bad case the sorting can take around ~(4*10^8 — 5*10^8) operations and give a Time Limit Exceeded.
Now I wanted to know that can this type of case happen during a submission in Codeforces or It can never happen.
Sorry for silly question.
Thanks in advance.