The partitioning step in Quick Sort has a time complexity of O(n) as it involves a single pass through the array.