Question

Derive the best worst and average case for quick sort

Answer 1

Explanation:

Velocity is defined as the Rate of change of displacement

Velocity = d/t

50 /2 = 25

V= u + at

25 = 10 + a× 2

a = 15/2

a = 7.5

=

Answer 2

Analysis of QuickSort k is the number of elements which are smaller than pivot. The time taken by QuickSort depends upon the input array and partition strategy. Following are three cases. Worst Case: The worst case occurs when the partition process always picks greatest or smallest element as pivot

hope it helped you out with the question

thanks

please mark as BRAINLIEST