asd questions

• How can Timsort beat the O(n log n) sorting bound in some cases?
• why we are always using quick sort ? or any specific sorting algorithm?

asd answers