Are you sure you're getting this? Fill in the missing part by typing it in.

The time complexity of QuickSort is ____ in the worst-case scenario due to the possible occurrence of unbalanced partitions. On the other hand, the time complexity of MergeSort is always ____ regardless of the input. This makes MergeSort a reliable choice when a consistent time complexity is required. Additionally, QuickSort has a space complexity of ____, while MergeSort has a space complexity of ____ due to the additional memory required for merging the sorted subarrays. Overall, QuickSort is often preferred when ___ is a concern and the input size is ____, while MergeSort is a good choice when _ is limited and a consistent time complexity is needed.