/**
 * Inplace quick insertion sorting algorithm for numeric values
 * 1. using a stack to eliminate recursion
 * 2. sorting inplace to reduce memory usage
 * 3. using insertion sort for small partition sizes
 * The original source code is from:
 * https://www.measurethat.net/Benchmarks/Show/3549/0/javascript-sorting-algorithms
 * https://quick.work/?page=view-blog&id=24
 *
 * @param arr
 */
export default function quickInsertionSort(arr: number[]): void;