PA of Algorithms Q103

0. Let P be a quicksort program to sort numbers in ascending order. Let t₁ and t₂ be the time taken by the program for the inputs [1 2 3 4] and [5 4 3 2 1], respectively. Which of the following holds?

Answer
Comment
Array

Option : A
Explanation :
It input is in either ascending order or in descending order both are worst case of quick sort Algorithms.

You must be logged in to post a comment.

You must be logged in to post a comment.

Forgot your password?

I agree with the Terms.