Which of the following is the Best Case Time Complexity of the Quicksort algorithm?A. O(n² log n)²B. O(n²)C. O(n)D. O(n log n)Leave a ReplyCommentEnter your name or username to commentEnter your email address to commentEnter your website URL (optional)
