RFR: 8360023: Add an insertion sort implementation to Hotspot

[Quan Anh Mai]

Hi,

This PR adds an implementation of insertion sort to Hotspot. It is an algorithm that is inplace and stable, and it is the ideal algorithm for arrays with small numbers of elements. The motivation for this is [JDK-8357186](https://bugs.openjdk.org/browse/JDK-8357186) in which a stable sort is desired and the number of elements is small.

In addition, I make some improvements to `GrowableArrayIterator`:

- Make a non-const variant (our current iterator is const only).
- Add various utility operators to align with a typical iterator.

Please take a look and share your thoughts. Thanks very much.

-------------

Commit messages:
 - add insertion sort and modernize GrowableArrayIterator

Changes: https://git.openjdk.org/jdk/pull/25895/files
  Webrev: https://webrevs.openjdk.org/?repo=jdk&pr=25895&range=00
  Issue: https://bugs.openjdk.org/browse/JDK-8360023
  Stats: 231 lines in 3 files changed: 219 ins; 0 del; 12 mod
  Patch: https://git.openjdk.org/jdk/pull/25895.diff
  Fetch: git fetch https://git.openjdk.org/jdk.git pull/25895/head:pull/25895

PR: https://git.openjdk.org/jdk/pull/25895