arrow

ARROW-6732: [Java] Implement quick sort in a non-recursive way to avoid stack overflow

The current quick sort algorithm in implemented by a recursive algorithm. The problem is that for the worst case, the number of recursive layers is equal to the length of the vector. For large vectors, this will cause stack overflow.

To solve this problem, we implement the quick sort algorithm as a non-recursive algorithm.

Closes #5540 from liyafan82/fly_0929_recurse and squashes the following commits:

9c7a71eab <liyafan82>  Push larger part to stack first to reduce stack size
6ec131715 <liyafan82>  Implement off heap int stack
a72e1aa5e <liyafan82>  Use integer stack to improve readability
c6888c7ef <liyafan82>  Implement quick sort in a non-recursive way to avoid stack overflow

Authored-by: liyafan82 <fan_li_ya@foxmail.com>
Signed-off-by: Micah Kornfield <emkornfield@gmail.com>