Sorting
closed

closed by
524 views
0 votes
0 votes
closed with the note: solved this..
Let P be a Quicksort Program to sort numbers in ascending order using the first element as
pivot. Let t1 and t2 be the number of comparisons made by P for the inputs {1, 2, 3, 4, 5} and {4,1, 5, 3, 2} respectively. Which one of the following holds?
A. t1 = 5 B. t1< t2
C. t1> t2 D. t1 = t2
closed by

Related questions

0 votes
0 votes
2 answers
2
_Madhuri asked Oct 9, 2021
634 views
The complexity of comparison based sorting algorithm is (nlogn) .How?
1 votes
1 votes
1 answer
4
iarnav asked May 4, 2019
834 views
I’ve seen this wikipedia article – https://en.wikipedia.org/wiki/Comparison_sortAlso see this link – https://gateoverflow.in/32948/minimum-number-of-comparisonshttp...