IOM 2019, Блиц — Задача 38

OLYMPIAD OF METROPOLISES, Moscow, September 2, 2019 · 2 септември 2019 г.

Условие

Quick sort is a commonly used algorithm, its time complexity on average is $\underline{\qquad\qquad}$, time complexity for best possible input is $\underline{\qquad\qquad}$, time complexity for worst possible input is $\underline{\qquad\qquad}$.

1. $O(nlogn)$, $O(n)$, $O(nlogn)$

2. $O(nlogn)$, $O(n)$, $O(n^2)$

3. $O(nlogn)$, $O(nlogn)$, $O(n^2)$

4. $O(n^2)$, $O(nlogn)$, $O(n^2)$

5. $O(n^2)$, $O(n^2)$, $O(n^2)$

Решение

---

Оригинал в Архива: blitz-en-all-task-final.pdf