IOM 2021, Блиц — Задача 13
The Blitz-contest of IOM-2021
Условие
Which option best describes the following code?
![C++ code listing of seven lines: an outer loop over i from 0 to n − 1, an inner loop over j from i to n − 1, and inside it, if a[i] is greater than a[j], a call swap(a[i], a[j]); the blocks are closed by curly brackets.](https://pub-43290baaaff14857b5dd59610ea438c7.r2.dev/problems/iom-2021-blitz-tasks-eng/p13-fig1.png)
- Bubble Sort
- Selection Sort
- Insertion Sort
- Quick Sort
- Merge Sort
Отговори
B
Answer key: B — the second option, “Selection Sort”.
Решение
Informatics(3). Answer: B
Оригинал в Архива: iom-2021-blitz-tasks-eng.pdf · официални решения: iom-2021-blitz-answers-eng.pdf