# Show that the worst-case running time of quick-select on an n-element sequence is (n 2 ).

Chapter 9, Reinforcement #5

Show that the worst-case running time of quick-select on an n-element sequence is Ω(n^{2}).

## This problem has been solved!

Do you need an answer to a question different from the above? Ask your question!

**Related Book For**

## Algorithm Design And Applications

1st Edition

Authors: Michael T. Goodrich, Roberto Tamassia

ISBN: 9781118335918