The time complexity of Quick Sort is O(n log n) on average, but O(n^2) in the worst case.
The space complexity of Quick Sort is O(log n) due to the recursive stack space.
Quick Sort is used in various applications like:
Quick Sort is in-place and doesn't require additional space like Merge Sort.
Quick Sort has a worst-case time complexity of O(n^2) which can be avoided with good pivot selection strategies.