There is a new LTS release — JDK 17, so I suggest the administration to update JDK.
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 21.12.2024 08:06:30 (k1).
Десктопная версия, переключиться на мобильную.
При поддержке
Just my opinion, but most new releases, for any language, have very minimal impact on competitive programming. So it doesn't really matter if it's added to cf or not.
Arrays.sorton primitives now are guaranteed $$$O(nlog{n})$$$.source?
The documentation for OpenJDK 17 says 'This algorithm offers O(n log(n)) performance on all data sets'.
The documentation for OpenJDK 11 says 'This algorithm offers O(n log(n)) performance on many data sets'.
The JEP is here.
The GitHub commit is here.
Sources:
OpenJDK 17: https://devdocs.io/openjdk~17/java.base/java/util/arrays#sort(float[])
OpenJDK 11: https://devdocs.io/openjdk~11/java.base/java/util/arrays#sort(float[])
Cool! Looks like it was introduced in jdk14 and I did not know about it.