Analyze the time and space complexity of the QuickSort algorithm. Explain both best-case and worst-case scenarios, and discuss how different pivot selection strategies affect performance. Propose a modification to QuickSort and analyze how it would impact the algorithm's theoretical and practical performance.