determine complexity of quiick sort
Answers
Answered by
0
quick sort uses division of the data set into half, and then quick sorting each half using the recursive algorithm. It uses memory space due to recursion.
There are Log n to base 2 number of recursions.
There are on an average n (order of n) operations at each level.
Thus the complexity is : n * log n base 2.
There are Log n to base 2 number of recursions.
There are on an average n (order of n) operations at each level.
Thus the complexity is : n * log n base 2.
kvnmurty:
clik on thanks.
Similar questions