IOM 2017, Блиц — Задача 62

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

Условие

Which of the following sorting algorithms achieve(s) a worst-case time complexity of O(N log N), when sorting N numbers in ascending order?

1. Bubble sort
2. Merge sort
3. Selection sort
4. Quick sort
5. Heap sort

Отговори

Решение

Оригинал в Архива: blitz.pdf · официални решения: answers-blitz.pdf