There is a new LTS release — JDK 17, so I suggest the administration to update JDK.
→ Pay attention
Before contest
Codeforces Round 940 (Div. 2) and CodeCraft-23
2 days
Register now »
Codeforces Round 940 (Div. 2) and CodeCraft-23
2 days
Register now »
*has extra registration
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | ecnerwala | 3648 |
| 2 | Benq | 3580 |
| 3 | orzdevinwang | 3570 |
| 4 | cnnfls_csy | 3569 |
| 5 | Geothermal | 3568 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3530 |
| 8 | Radewoosh | 3520 |
| 9 | Um_nik | 3481 |
| 10 | jiangly | 3467 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | adamant | 164 |
| 2 | awoo | 164 |
| 4 | TheScrasse | 160 |
| 5 | nor | 159 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 150 |
| 7 | SecondThread | 150 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Apr/19/2024 16:57:02 (l2).
Desktop version, switch to mobile version.
Supported by
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.