1 . The average-case time complexity of Quicksort is O(n*log(n)), which is quicker than Merge Sort, Bubble Sort, and other sorting algorithms. However, the worst-case time complexity is O(n^2) when the pivot choice consistently results in unbalanced partitions. To mitigate this, randomized pivot selection is commonly used.

• Attach answer script

Answer: Option False

Explanation: