BigDecimal has a discussion section about Algorithmic Complexity of toPlainString. However, that is in the class-level notes and somewhat hard to discover; we can add a link in the "See also" section.
--------- - [x] I confirm that I make this contribution in accordance with the [OpenJDK Interim AI Policy](https://openjdk.org/legal/ai). ------------- Commit messages: - Refer to algorithmic complexity for BigDecimal.toPlainString Changes: https://git.openjdk.org/jdk/pull/31413/files Webrev: https://webrevs.openjdk.org/?repo=jdk&pr=31413&range=00 Issue: https://bugs.openjdk.org/browse/JDK-8386113 Stats: 1 line in 1 file changed: 1 ins; 0 del; 0 mod Patch: https://git.openjdk.org/jdk/pull/31413.diff Fetch: git fetch https://git.openjdk.org/jdk.git pull/31413/head:pull/31413 PR: https://git.openjdk.org/jdk/pull/31413
