isn't there a function to sort in place an `IntArr...

# stdlib

[elect]

isn't there a function to sort in place an IntArray with a given comparator? I see only sortedWith, which returns a new sorted list

[Derek Peirce]

It doesn't seem to exist in stdlib at all, though I agree that it should.

[Michael de Kaste]

this is Java functionality: You can't do it with 'primitives', but you can using an typed array:

val array = Array(10) { it }

        Arrays.sort(array, reverseOrder())

[Sam]

Was just about to say — IntArray deals in primitives and Comparators deal in objects, which means there would be a lot of boxing involved if such a method existed

[Klitos Kyriacou]

To avoid boxing, you can use third-party primitive collection libraries (and primitive-type comparators) such as Eclipse Collections and Fastutil (both are JVM only).

[elect]

isn't possible to avoid boxing with an inlined function designed explicitly for primitive arrays?

[Derek Peirce]

Possible if Comparator were replaced with a traditional lambda, but I think the sheer amount of code that would have to be inlined for an optimized sorting method would make that a poor candidate for inlining.