Computer Science, asked by wwwmirabhakat425, 1 year ago

What is the running time of quick sort in its worst case?

Answers

Answered by Trickylearner

0

1.Worst-case performanceO(n2)
2.Best-case performanceO(n log n)
3.Average performanceO(n log n)

Previous Question

Next Question

Similar questions

Math, 6 months ago

The midpoint of 3.4) and 5.6) O (56) O (4,6...

English, 6 months ago

John lost the_____ pens he had. 1)more 2)few 3) little 4) a...

History, 6 months ago

One pot contains 8 litre of milk while other contains 750 milliliter...

Computer Science, 1 year ago

Explain about primary key super key candidate key alternate key composite key foreign key?

Biology, 1 year ago

what is an analogy for population...

English, 1 year ago

As the reporter of times of india write a report on the fire accident on the market place wch you witnessed...

Social Sciences, 1 year ago

The glove and the lion by james henry leigh hunt question and answers lets learn through net...

English, 1 year ago

summary on Fritz, short story written by Satyajit Ray...