Step 1: Understand what Quick Sort is. It is a sorting algorithm that divides an array into smaller parts (sub-arrays) and sorts them.
Step 2: Know that Quick Sort uses a 'pivot' element to divide the array. The elements less than the pivot go to one side, and those greater go to the other side.
Step 3: Realize that Quick Sort works best when the pivot divides the array into two roughly equal parts.
Step 4: Identify the scenario where Quick Sort performs poorly: when the array is already sorted.
Step 5: Understand that if the pivot is chosen poorly (like always picking the first or last element in a sorted array), it can lead to unbalanced partitions.
Step 6: Recognize that this unbalanced partitioning causes Quick Sort to take longer, resulting in a time complexity of O(n^2).
