and 3 others joined a min ago.
0
3.4kviews
Explain the analysis of quick sort and apply the same to sort following data. [1 0 7 5 9 12 3].
1 Answer
0
83views
written 8.7 years ago by
teamques10
★ 70k
|
Analysis of Quick Sort:
T(N) = T(i) + T(N - i -1) + cN
The time to sort the file is equal to
o the time to sort the left partition with i elements, plus
o the time to sort the right partition with N-i-1 elements, plus
o the time …
ADD COMMENT
EDIT
Please log in to add an answer.