You are given a Python function implementing a bubble sort algorithm. Analyze the time complexity and refactor it to implement Timsort (Python's built-in sort) or a QuickSort variant manually. Explain why your chosen method is more efficient for large datasets compared to the original bubble sort. Include comments explaining the logic step-by-step.