Vladimir Zakharov

`sortThis(...)` and `sortThisBy(...)` methods ultimately delegate to `IntQuickSort.sort(...)` for IntLists (and so on for all primitives). `IntQuickSort` is basically a classic quicksort with some tweaks so it is recursive. It...

@javafanboy - thank you for the detailed write up (and for opening the issue). A couple of thoughts: 1. We can make the sorting algorithm pluggable. I see three options...

`[Primitive]ArrayList.sortThis()` does use `Arrays.sort()` for ascending sorting by list value order. You need something else if your requirement is to sort based on a comparator so `[Primitive]ArrayList.sortThis()` variants use a...

@mohrezaei - thank you for looking into this. A couple of questions: 1. Any idea why JDK `Arrays.sort(..,[comparator])` methods for Objects use TimSort, while `Arrays.sort(...)` for primitive types use DPQ?...