There are some people who say that quick sort is faster than merge sort on average, but it is much slower than merge sort in the worst case.

Would you agree with them? Explain your reasoning clearly, and give at least one example. You should give an sample pseudocode algorithm and prove your thought.